JavaScript Program for Armstrong Numbers

In this article, we will see a JavaScript program to check whether the given number is an Armstrong number or not. 

An Armstrong Number is an n-digit number that is the sum of the nth power of its all digits. For instance, Consider a 3-digit number, i.e., 153, which is a 3-digit number, & the sum of the cube of all its digits will be the number itself, i.e. 153.

13 = 1
53 = 5*5*5 = 125
33 = 3*3*3 = 27
13 + 53 + 33 = 1+125+27 = 153  

To generalize it to a particular syntax form, then the following syntax will be used:

abcd… = pow(a,n) + pow(b,n) + pow(c,n) + pow(d,n)+....

Here a,b,c,d,… denotes the Base number & n denotes the exponent number.

Several methods can be used to check if a number is an Armstrong number or not, which are listed below:

Approach 1: Using toString() and split() Method

In this method, we can convert the given input number to a string using toString() and then an array using split() method to get the individual digits of the number. Then reduce() method iterates over each digit and accumulates the sum using the acc parameter. It uses Math.pow() method to raise each digit to the power of order. After calculating the sum, the function compares it with the original number. If the sum is equal to the number, it prints a message indicating that it is an Armstrong number.

Syntax:

// Syntax for toString() Method
obj.toString()

// Syntax for split() Method
str.split(separator, limit)

Example: In this example, we are using the toString() method & the split() method to check the Armstrong number.

Javascript

function isArmstrong(number) {
    const digits = number.toString().split('');
    const order = digits.length;
    const sum = digits.reduce(
        (acc, digit) =>
            acc + Math.pow(parseInt(digit), order), 0);

    if (sum === number) {
        console.log(
            number + " is an Armstrong Number");
    }
    else {
        console.log
            (number + " is not an Armstrong Number");
    }
}

isArmstrong(9474);
isArmstrong(520);

Output

9474 is an Armstrong Number
520 is not an Armstrong Number

Approach 2: Using naive Method

The naive approach would be a simple algorithm that repeatedly iterates through a set of numbers and tests each one to see if it is an Armstrong number. In this approach, a loop is used to get the digits of the number and then the sum is calculated as the sum of the nth power of each digit.

Example: This example implements the naive Method for verifying the Armstrong number.

Javascript

function isArmstrong(number) {
    let temp = number;
    let o = order(temp)
    let sum = 0;

    // Loop until temp is greater than 0
    while (temp) {
        remainder = temp % 10;

        // Floor value of the quotient
        temp = Math.floor(temp / 10);
        sum = sum + Math.pow(remainder, o);
    }
    if (sum === number) {
        console.log(number + " is an Armstrong Number");
    }
    else {
        console.log(number + " is Not an Armstrong Number");
    }
}

// Function to calculate number of digits
function order(number) {
    let n = 0;
    while (number > 0) {
        n++;
        number = Math.floor(number / 10);
    }
    return n;
}

// Input value 153
isArmstrong(153);

// Input value 520
isArmstrong(520);

Output

153 is an Armstrong Number
520 is Not an Armstrong Number

Approach 3: Using Array.from() Method

We can also get the digits using Array.from() method that converts the object into an array as shown below. By utilizing this method, you can get the same result without explicitly using the toString() and split() functions.

Syntax:

Array.from(object, mapFunction, thisValue);

Example: Here we are using the above-explained method.

Javascript

function isArmstrong(number) {
    const digits = Array.from(String(number), Number);
    const order = digits.length;

    // Calculate the total sum using array.map()
    const sum = digits.reduce(
        (acc, digit) =>
            acc + Math.pow(parseInt(digit), order), 0);

    if (sum === number) {
        console.log(
            number + " is an Armstrong Number");
    }
    else {
        console.log(
            number + " is not an Armstrong Number");
    }
}

// Input number 1634
isArmstrong(1634);

// Input number 749
isArmstrong(749);

Output

1634 is an Armstrong Number
749 is not an Armstrong Number

Approach 4: Using Array Reduce() method

• Converts the number to a string.
• Uses the reduce method on the array of digits to calculate the sum.
• Raises each digit to the power of the number of digits.
• Checks if the sum is equal to the original number.

Example: In this example, we are using Array Reduce() method.

Javascript

function isArmstrong(number) {
    const numStr = number.toString();
    const numDigits = numStr.length;

    const sum = [...numStr].reduce((acc, digit) =>
        acc + Math.pow(parseInt(digit), numDigits), 0);

    return sum === number;
}

console.log(isArmstrong(153));  // Example usage

Output

true