There is a very similar Mathoverflow question, in which it was shown that the ratio of odd-bit primes against even-bit primes approaches $1/2$. In fact, the rigourous proof can be found in
C. Mauduit and J. Rivat, _Sur un problème de Gelfond: la somme des chiffres des nombres premiers_ , Ann. Math.