Terence Tao in his brilliant book Solving Mathematical Problems: a Personal Perspective states (page 17):
It is highly probable (though not proven!) that the digit-sum of $2^{n}$ is approximately $(4.5 \log_{10} 2)n≈1.355n$ for large $n$.
This problem sounds very interesting to me! Do you know something more about this problem? What is its exact formulation (replacing word approximately with a limit)? Is it still not proven?
I found only this which does not satisfy me enough.
Thank you very much for your answers and have a nice week!