Login and get codingIn number theory there are many interesting numbers - eg.

Armstrongnumbers,Happynumbers,Meertensnumbers, just to name a few.In this bite, you will try to solve the

Armstrong number question: given an integer, determine if it is anarmstrong number.An armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits. See this reference for more info and here are some examples:

a) 153 is an armstrong number. It's a 3 digits number:

(1^3) + (5^3) + (3^3)= 153.b) 371 is also an armstrong number.

c) any single digit numbers (1-9) are armstrong numbers as well.

Metrics »

371 out of 373 users completed this Bite.

Will you be Pythonista #372 to crack this Bite?

Resolution time: ~20 min. (avg. submissions of 5-240 min.)

Pythonistas rate this Bite 3.29 on a 1-10 difficulty scale.

» You can do it! 😌

Ask for Help