Let $G_n$ be the coprime graph on $\{1,\ldots,n\}$. We prove that the mixed vertex-coloring coprime Ramsey number satisfies \[ \Rcop(k_1,\ldots,k_c)=p_{\sum_{i=1}^c(k_i-1)}, \] where $p_m$ is the $m$-th prime. The proof is elementary: the prime clique $\{1\}\cup\{p\le n:p\text{ prime}\}$ gives the upper bound by pigeonhole, while a prime-bin partition gives the matching lower bound by coloring each composite with a bin containing one of its prime divisors. We reserve $\Rcop$ for this vertex-coloring parameter; the edge-coloring parameter on the same host graph is denoted $\Redge$. The same certificate viewpoint yields several extensions, including a support-disjointness generalization, a polynomial-time certificate-extraction primitive, and an exact reduction of the edge-coloring variant to classical Ramsey numbers: $\Redge(k_1,\ldots,k_c)=p_{\Rcl(k_1,\ldots,k_c)-1}$. These two formulas are rank transfers from the same clique-label certificate. We also prove that the balanced two-color diagonal threshold equals the unrestricted threshold $p_{2k-2}$ for all $k\ge2$, via a deterministic prime-bin split requiring only the weak inequality $2p_m<p_{2m}<3p_m$; for fixed $c$, a Hall argument plus a standard Selberg--Delange estimate gives eventual multicolor balanced certificates.