Problem 57298. Easy Sequences 82: Digits of Powers of 2
In Project Euler Problem #16, we are asked for sum of the digits of powers of 2. Here we will be asked for more than that.
Given an integer power n, create a function the outputs  , where:
, where:
- a is the first 5 digits of , 
- b is the last 5 digits of , 
- c is the number of digits of , and 
- d is the sum of the digits of . 
For example, for  since
 since  , therefore
, therefore  . If
. If  , please output
, please output  , therefore for
, therefore for  ,
,  .
.
As an added challenge, some functions are disabled.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
- 
         Find relatively common elements in matrix rows 2107 Solvers 
- 
         Sum the elements in either diagonal of a square matrix 215 Solvers 
- 
         
         101 Solvers 
- 
         The Answer to Life, the Universe, and Everything 559 Solvers 
- 
         
         254 Solvers 
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!