👋Learning to code? Check out ourbrand new Bootcampfor beginners!
An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits.
For example:
9 = 9^1 = 9
10 != 1^2 + 0^2 = 1
153 = 1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153
154 != 1^3 + 5^3 + 4^3 = 1 + 125 + 64 = 190
Write some code to determine whether a number is an Armstrong number.
Some of the tests might pass a BigInt as input.
Ensure that your implementation can handle such cases.
Edit via GitHub
Sign up to Exercism to learn and master JavaScript with 33 concepts, 149 exercises, and real human mentoring, all for free.