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

Big Numbers
- 11 Problems
- 38 Finishers
- How to add?
- How to subtract?
- How to multiply?
- Infinite precision division
- Sum of big primes without primes
- Sums of cubes and squares of sums
- Divisible by 13
- Hexagonal numbers on a spiral matrix
- Project Euler: Problem 16, Sums of Digits of Powers of Two
- Large Sum (inspired by Project Euler 13)
- It's going down. We're finding simbers!
Problem Recent Solvers343
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!