How to usetoString() and split() Method in Javascript

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

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:

Table of Content

  • Using toString() and split() Method
  • Using naive Method
  • Using Array.from() Method 
  • Using Array Reduce

Similar Reads

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....

Approach 2: Using naive Method

...

Approach 3: Using Array.from() 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....

Approach 4: Using Array Reduce() method

...

Contact Us