Armstrong Number Calculator - Sum of Digit Powers

An Armstrong number (also known as a narcissistic number, pluperfect digital invariant, or plus perfect number) is a number where the sum of each digit raised to the power of the total digit count equals the original number. The formal Armstrong number formula is:

For instance, 153 has 3 digits, so each digit is raised to the power of 3: 1³ + 5³ + 3³ = 1 + 125 + 27 = 153. Because the sum equals the original number, 153 is confirmed as an Armstrong number. This self-referential property is what makes these numbers mathematically fascinating.

Checking whether a number is Armstrong follows a simple algorithm. Here is the step-by-step process our Armstrong number checker uses:

1. Count the digits. Determine how many digits the number has. For 1634, the digit count is 4.
2. Separate the digits. Break the number into individual digits: 1, 6, 3, 4.
3. Raise each digit to the power of the digit count. Compute 1&sup4; = 1, 6&sup4; = 1296, 3&sup4; = 81, 4&sup4; = 256.
4. Sum the results. Add all the powered values: 1 + 1296 + 81 + 256 = 1634.
5. Compare. Since 1634 = 1634, the number is an Armstrong number.

Try entering 8208 or 9474 in the calculator above to see this verification process in action. The same method works for any number of digits — for three-digit numbers the exponent is 3, for five-digit numbers it's 5, and so on.

There are exactly 88 Armstrong numbers in base 10. Here is the complete list organized by digit count, which you can verify using the range finder above:

The three-digit Armstrong numbers (153, 370, 371, 407) are the most commonly asked about. Notice there are no two-digit Armstrong numbers — you can prove this because for any two-digit number ab, the maximum possible sum a² + b² is 9² + 9² = 162, but the pattern doesn't produce any matches. The largest known Armstrong number has 39 digits: 115,132,219,018,763,992,565,095,597,973,971,522,401.

The four three-digit Armstrong numbers are among the most searched examples. Here is the complete verification for each one:

Each three-digit number uses the exponent 3 because there are three digits. You can verify all four of these by clicking them in the "Known Armstrong Numbers" section above. The calculator shows the full step-by-step process for each.

Yes, 9474 is an Armstrong number. It is one of only three four-digit Armstrong numbers (along with 1634 and 8208). Here is the complete verification:

Similarly, 1634 is an Armstrong number: 1&sup4; + 6&sup4; + 3&sup4; + 4&sup4; = 1 + 1296 + 81 + 256 = 1634. And 8208 is an Armstrong number: 8&sup4; + 2&sup4; + 0&sup4; + 8&sup4; = 4096 + 16 + 0 + 4096 = 8208. These three are the only four-digit numbers with this property.

Armstrong numbers and perfect numbers are both special categories in number theory, but they are defined very differently:

A number can be both Armstrong and have other special properties. For example, 153 is an Armstrong number and a triangular number (1 + 2 + ... + 17 = 153). However, no number is both Armstrong and perfect. Use our perfect number calculator to explore that category separately.

Armstrong number checks are one of the most popular programming exercises because they combine several fundamental concepts: loops, digit extraction, exponentiation, and comparison. Here is the basic algorithm in pseudocode:

function isArmstrong(N):
    digits = getDigits(N)
    n = length(digits)
    sum = 0
    for each digit d in digits:
        sum = sum + d^n
    return sum == N

This algorithm runs in O(n) time where n is the number of digits, making it efficient for checking individual numbers. Our calculator extends this with range scanning, custom exponents, and multi-base support. For related power calculations, try our exponent calculator.

Armstrong numbers appear in coding interviews, competitive programming, and as exercises in courses on algorithm design. They teach students how to decompose a number into digits — a skill used in digit sum problems, palindrome checks, and other number theory applications. For broader number classification, see our prime number calculator.

Explore more number theory calculators to deepen your understanding of mathematical properties:

• Perfect Number Calculator — Check if a number equals the sum of its proper divisors
• Prime Number Calculator — Test primality and find prime factorizations
• Exponent Calculator — Compute powers and exponential expressions
• Modulo Calculator — Calculate remainders in division
• Factorial Calculator — Compute n! for combinatorics and probability
• Palindrome Calculator — Check numbers and text for palindromic properties
• All Number Theory Calculators — Browse the full category