JavaScript Program to Check Armstrong Number

A positive integer is called an Armstrong number (of order n) if

abcd... = an + bn + cn + dn + ...

In the case of an Armstrong number of 3 digits, the sum of cubes of each digit is equal to the number itself. For example, 153 is an Armstrong number because

153 = 1*1*1 + 5*5*5 + 3*3*3

Similarly, 1634 is an Armstrong number because:

1634 = 1*1*1*1 + 6*6*6*6* + 3*3*3*3 + 4*4*4*4

Example 1: Check Armstrong Number of Three Digits

Output

Enter a three-digit positive integer: 153
153 is an Armstrong number.

The above program takes an input from the user. Then,

1. The number entered by the user is stored in a temporary variable temp.
2. A while loop is used to iterate a three-digit value.
   1. The modulus operator % is used to obtain each digit number. When a number is divided by 10, the remainder is the last digit. In the first iteration, 153 % 10 gives 3.
   2. The remainder digit's cube is calculated by multiplying the digit three times. And the cube is added to the sum variable.
   3. The digit is divided by 10 to remove the last digit.
   4. The while loop continues iterating and dividing the number by 10 until the number is 0.
3. Finally, the sum is compared with the number entered by the user. If the sum and the number are equal, the number is an Armstrong number.

Note: In the above program, the cube of a number could be calculated using an exponent operator **. For example, sum += remainder ** 3;

Example 2: Check Armstrong Number of n Digits

Output

Enter a positive integer: 92727
92727 is an Armstrong number

In the above program, an Armstrong number of n digits is checked.

When the user enters a number, it is taken as a string. The length property returns the length of a string.

The number entered by the user is stored in a temp variable. And a while loop is used to iterate until its value is less than 0. Each digit of the number is raised to the power of the length of the number.