We show that if Fn = 22n + 1 is the nth Fermat number, then the binary digit sum of p(Fn) tends to infinity with n, where p(x) is the counting function of the primes p £ x. We also show that if Fn is not prime, then the binary expansion of f(Fn) starts with a long string of 1’s, where f is the Euler function. We also consider the binary expansion of the counting function of irreducible monic polynomials of degree a given power of 2 over the field F2. Finally, we relate the problem of the irrationality of Euler constant with the binary expansion of the sum of the divisor function.