Checking whether the sum of digits of a number forms a Palindrome Number or not in JavaScript

We are required to write a JavaScript function that takes in a number, sums its digits and checks whether that sum is a Palindrome number or not. The function should return true if the sum is Palindrome, false otherwise.

For example, if the number is 697,

Then the sum of its digit will be 22, which indeed, is a Palindrome number. Therefore, our function should return true for 697.

Example

Following is the code −

const num = 697;
const sumDigit = (num, sum = 0) => {
   if(num){
      return sumDigit(Math.floor(num / 10), sum + (num % 10));
   };
   return sum;
};
const isPalindrome = num => {
   const revered = +String(num)
   .split("")
   .reverse()
   .join("");
   return revered === num;
};
const isSumPalindrome = num => isPalindrome(sumDigit(num));
console.log(isSumPalindrome(num));

Output

This will produce the following output in console −

true

AmitDiwan

Published on 30-Sep-2020 14:16:06

• Related Questions & Answers
• Check whether sum of digit of a number is Palindrome - JavaScript
• Digit sum upto a number of digits of a number in JavaScript
• Check whether a number is a Fibonacci number or not JavaScript
• C++ Program to Check Whether a Number is Palindrome or Not
• Prime digits sum of a number in JavaScript
• Recursive sum all the digits of a number JavaScript
• Destructively Sum all the digits of a number in JavaScript
• Product sum difference of digits of a number in JavaScript
• Write a Golang program to check whether a given number is a palindrome or not
• Recursive sum of digits of a number is prime or no in C++
• Difference between product and sum of digits of a number in JavaScript
• Separating digits of a number in JavaScript
• Returning number of digits in factorial of a number in JavaScript
• Checking for permutation of a palindrome in JavaScript
• Checking digit sum of smallest number in the array in JavaScript