# Binary Problem

Level pending*n* be the number of integers *x* such that \( 2^{2013} \le x < 2^{2014} \) and when *x* is written in binary there are at least as many 0s as 1s. What is the sum of the digits of *n* when it is written in binary?

**Your answer seems reasonable.**Find out if you're right!

Sign up to access problem solutions.

**That seems reasonable.**Find out if you're right!

Already have an account? Log in here.