Problem 2690. Armstrong Number

• Created by VIVEK RUHELA
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Magic Numbers

• 19 Problems
• 84 Finishers

Number theory

• 44 Problems
• 21 Finishers

Like (8)

Difficulty:

(111)

Rate

• Solve Later   
• Add To GroupÂ

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

Solve

Solution Stats

49.38% Correct | 50.62% Incorrect

• 808 Solutions
• 344 Solvers

Last Solution submitted on Sep 18, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers344

Suggested Problems

• Back to basics 22 - Rotate a matrix

  922 Solvers

• Is the Point in a Circle?

  620 Solvers

• Vectorize the digits of an Integer

  328 Solvers

• Basics: 'Find the eigenvalues of given matrix

  427 Solvers

• Divisible by 2

  595 Solvers

More from this Author1

• Toeplitz Matrix

  254 Solvers