www.mikescher.com/www/statics/euler/Euler_Problem-016_explanation.md

Here I implemented a long multiplication algorithm. Then I took the value 1 and doubled it 1000 times. The calculation of the digit sum was then easy.