Armstrong Number Checker
Check whether a number equals the sum of its own digits each raised to the digit-count power, like 153 = 1³ + 5³ + 3³. Lists every Armstrong number in a range too.
🌟 What is an Armstrong Number?
Armstrong numbers, also called narcissistic numbers, are whole numbers with a curious self-referential property: if you take every digit, raise it to the power of the total digit count, and add the results, you get the original number back. The most famous example is 153: it has 3 digits, and 1³ + 5³ + 3³ = 1 + 125 + 27 = 153, exactly matching where it started.
These numbers are named after Michael F. Armstrong, who studied and popularized the concept, though the underlying idea is sometimes traced to earlier recreational mathematics. Armstrong numbers appear frequently as introductory programming exercises because checking one requires basic loops, digit extraction, and exponentiation, making them a natural test case for beginner coders in nearly every language. They are also a staple of recreational number theory, alongside related curiosities like perfect numbers and happy numbers.
A common misconception is that Armstrong numbers are rare or hard to find at scale. In fact, there are only 88 Armstrong numbers in the entire base-10 number system, and the largest one has 39 digits. This finiteness is a direct mathematical consequence of the fact that a d-digit number can be at most 10^d, while the maximum possible digit-power sum for d digits is only d × 9^d, and 9^d eventually grows far slower than 10^d as d increases, meaning no d-digit number beyond a certain size can ever satisfy the Armstrong condition.
This calculator offers two modes. Check Number tests any single whole number and shows the complete digit^power breakdown, whether it matches. List in Range scans an entire span of integers (up to 1,000,000 numbers at once) and reports every Armstrong number found within it, which is useful for exploring the full pattern (0-9, then 153, 370, 371, 407, then the 4-digit ones) without checking each number by hand.
📐 Formula
📖 How to Use This Calculator
Steps
💡 Example Calculations
Example 1 — The Classic Armstrong Number
Is 153 an Armstrong number?
Example 2 — A 4-Digit Armstrong Number
Is 9474 an Armstrong number?
Example 3 — A Near Miss
Is 9475 an Armstrong number?
Example 4 — Single-Digit Numbers Are Trivially Armstrong
Is 7 an Armstrong number?
Example 5 — Listing All Armstrong Numbers Up to 1,000
Find every Armstrong number between 1 and 1,000
❓ Frequently Asked Questions
🔗 Related Calculators
What is an Armstrong number?
An Armstrong number (also called a narcissistic number) is a number that equals the sum of each of its own digits raised to the power of the total digit count. For a d-digit number N with digits d₁, d₂, ..., dₐ, N is Armstrong when N = d₁^d + d₂^d + ... + dₐ^d. The classic example is 153: it has 3 digits, and 1³ + 5³ + 3³ = 1 + 125 + 27 = 153.
Why is 153 an Armstrong number?
153 has 3 digits: 1, 5, and 3. Raise each to the power 3 (the digit count) and sum: 1³ + 5³ + 3³ = 1 + 125 + 27 = 153, which equals the original number. This self-referential property is what makes it, and numbers like it, special enough to have their own name.
Is 9474 an Armstrong number?
Yes. 9474 has 4 digits, so raise each digit to the 4th power: 9⁴ + 4⁴ + 7⁴ + 4⁴ = 6,561 + 256 + 2,401 + 256 = 9,474, which matches the original number exactly. 9474 is a well-known 4-digit Armstrong number.
Are single-digit numbers Armstrong numbers?
Yes, trivially. Any single-digit number n has d = 1 digit, and n¹ = n by definition, so the condition N = sum of digit powers is always satisfied. All of 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 are Armstrong numbers.
How many Armstrong numbers exist?
There are exactly 88 Armstrong numbers in base 10, and the sequence is finite. The largest known Armstrong number in base 10 has 39 digits: 115,132,219,018,763,992,565,095,597,973,971,522,401. Beyond a certain number of digits, the maximum possible digit-power sum (9^d times d digits) grows much slower than the number itself (10^(d-1)), guaranteeing no more solutions exist past that point.
What are some famous Armstrong numbers?
Besides all single digits (0-9), the well-known small Armstrong numbers are 153, 370, 371, and 407 (all 3-digit), and 1634, 8208, and 9474 (all 4-digit). 370 and 371 are especially interesting neighbors: 370 = 3³+7³+0³ = 27+343+0 = 370, and 371 = 3³+7³+1³ = 27+343+1 = 371.
What is the difference between an Armstrong number and a narcissistic number?
They are the same thing - 'Armstrong number' and 'narcissistic number' are interchangeable terms for a number equal to the sum of its own digits, each raised to the power of the digit count. Some literature also calls this a perfect digital invariant (PDI) or pluperfect digital invariant (PPDI). The name 'Armstrong' honors Michael F. Armstrong, who studied and popularized these numbers.
How do you check if a number is Armstrong without a calculator?
Count the digits (d), raise each digit to the power d, and add the results. If the sum equals the original number, it is Armstrong. Example for 9475 (not Armstrong): 9⁴+4⁴+7⁴+5⁴ = 6,561+256+2,401+625 = 9,843, which does not equal 9,475, so 9475 fails the test.
Why is 9475 not an Armstrong number?
9475 has 4 digits, so the test is 9⁴+4⁴+7⁴+5⁴ = 6,561+256+2,401+625 = 9,843. Since 9,843 ≠ 9,475, the condition fails and 9475 is not an Armstrong number, even though it is one digit away from 9474, which is Armstrong.
Do Armstrong numbers exist in other number bases?
Yes. The Armstrong (narcissistic) number property is defined relative to whatever base is used to write the digits. In base 2 (binary), for instance, every number written as a string of digits d, with each digit raised to power d, is checked the same way, but the set of qualifying numbers differs from base 10. This calculator checks Armstrong numbers in base 10 only.
What is a perfect digital invariant?
A perfect digital invariant (PDI) generalizes the Armstrong number idea: instead of always using the digit count as the exponent, a PDI uses any fixed exponent p and checks whether the sum of digits raised to power p equals the original number. Armstrong numbers are the specific case where p equals the number of digits. Related families include happy numbers (repeated sum of squared digits equals 1) and perfect numbers (sum of proper divisors equals the number).
Can the List in Range mode find all Armstrong numbers under 1,000,000?
Yes - the List in Range mode scans every integer in your chosen range (up to a 1,000,000-number span) and reports every Armstrong number found. Since there are only 88 Armstrong numbers total in base 10, and the largest 4-digit one is 9474, a range scan from 1 to 1,000,000 will find every Armstrong number up to 6 digits, which is all of them below that size.