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:

(110)

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.32% Correct | 50.68% Incorrect

• 807 Solutions
• 343 Solvers

Last Solution submitted on Jan 30, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers343

Suggested Problems

• DNA N-Gram Distribution

  1357 Solvers

• It dseon't mettar waht oedrr the lrettes in a wrod are.

  1926 Solvers

• Is the Point in a Circle?

  616 Solvers

• Matlab Basics - Absolute Value

  632 Solvers

• Convert from Fahrenheit to Celsius

  25051 Solvers

More from this Author1

• Toeplitz Matrix

  246 Solvers