Problem 2690. Armstrong Number
Determine whether the given input n-digit number is Armstrong Number or not.
Return True if it is an Armstrong Number. An n-Digit Armstrong number is an integer such that the sum of the power n of its digit is equal to the number itself.
For Example:
371 = 3^3 + 7^3 + 1^3 or
1741725 = 1^7 + 7^7 + 4^7 + 1^7 + 7^7 + 2^7 + 5^7
Solution Stats
Problem Comments
-
2 Comments
Jan Orwat
on 25 Nov 2014
Same as problems 1008 and 2061.
Doddy Kastanya
on 8 Jan 2018
So Armstrong must be a narcissist :).
Solution Comments
Show commentsGroup

Number theory
- 44 Problems
- 21 Finishers
- Pseudo-vampire number
- Pell numbers
- Frugal number
- Be happy
- Bell Triangle
- find nth even fibonacci number
- Cantor counting
- check whether a number is a pentatope number
- generate nth pentatope number
- Fangs of a vampire number
- Find all vampire fangs
- Balanced number
- Mandelbrot Numbers
- Parasitic numbers
- Woodall number
- Kaprekar numbers
- Project Euler: Problem 4, Palindromic numbers
- Fangs of pseudo-vampire number
- Project Euler: Problem 9, Pythagorean numbers
- Mersenne Primes
- Sophie Germain prime
- Determine if input is a Narcissistic number
- Determine if input is a perfect number
- Ordinal numbers
- Lychrel Number Test (Inspired by Project Euler Problem 55)
- Circular Primes (based on Project Euler, problem 35)
- Largest Twin Primes
- Golomb's self-describing sequence (based on Euler 341)
- Is it an Armstrong number?
- Champernowne Constant
- Last non-zero digit
- Generate a Parasitic Number
- Smith numbers
- Evil Number
- Armstrong Number
- Polite numbers. Politeness.
- Polite numbers. N-th polite number.
- Narcissistic number ?
- Is this number Munchhausen?
- P-smooth numbers
- Iccanobif numbers 1
- Amicable numbers
- Extra safe primes
- Pentagonal Numbers
Problem Recent Solvers343
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!