Prime Numbers with a Fixed Number of One Bits or Zero Bits in Their Binary Representation

Abstract

We study the distribution of prime numbers that have a given number of one bits in their binary representation, and of those that have a given number of zero bits. We consider basic questions such as whether there are infinitely many of them, and explain their distribution in residue classes modulo small primes. We prove the unexpected result that, for m ≥ 3, there is no prime number with precisely 2^m bits, exactly two of which are zero bits.

Keywords:

• prime numbers
• binary representation