# Number of factors of summation

#### eddybob123

Let a(n) be the number of 1's in the binary representation of n. Show that the integer

$$\displaystyle \sum_{k=0}^{2^n-1}(-1)^{a(n)}2^k$$

has at least n! divisors.

#### eddybob123

Hint: think base 2.