The growth of digital sums of powers of 2

We give an elementary proof that the sum of the digits of $2^n$ in base 10 is greater than ${\log }_{4}n$. In particular, the limit of the sum of digits of $2^n$ is infinite.