Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Check if a given number divides the sum of the factorials of its digits

  • Last Updated : 20 May, 2021

Given an integer N, the task is to check whether N divides the sum of the factorials of its digits.

Examples: 

Input: N = 19 
Output: Yes 
1! + 9! = 1 + 362880 = 362881, which is divisible by 19.

Input: N = 20 
Output: No 
0! + 2! = 1 + 4 = 5, which is not divisible by 20.  

Approach: First, store the factorials of all the digits from 0 to 9 in an array. And, for the given number N check if it divides the sum of the factorials of its digits.

Below is the implementation of the above approach:  

C++




// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
 
// Function that returns true if n divides
// the sum of the factorials of its digits
bool isPossible(int n)
{
 
    // To store factorials of digits
    int fac[10];
    fac[0] = fac[1] = 1;
 
    for (int i = 2; i < 10; i++)
        fac[i] = fac[i - 1] * i;
 
    // To store sum of the factorials
    // of the digits
    int sum = 0;
 
    // Store copy of the given number
    int x = n;
 
    // Store sum of the factorials
    // of the digits
    while (x) {
        sum += fac[x % 10];
        x /= 10;
    }
 
    // If it is divisible
    if (sum % n == 0)
        return true;
 
    return false;
}
 
// Driver code
int main()
{
    int n = 19;
 
    if (isPossible(n))
        cout << "Yes";
    else
        cout << "No";
 
    return 0;
}
Java



// Java implementation of the approach
class GFG
{
     
    // Function that returns true if n divides
    // the sum of the factorials of its digits
    static boolean isPossible(int n)
    {
     
        // To store factorials of digits
        int fac[] = new int[10];
        fac[0] = fac[1] = 1;
     
        for (int i = 2; i < 10; i++)
            fac[i] = fac[i - 1] * i;
     
        // To store sum of the factorials
        // of the digits
        int sum = 0;
     
        // Store copy of the given number
        int x = n;
     
        // Store sum of the factorials
        // of the digits
        while (x != 0)
        {
            sum += fac[x % 10];
            x /= 10;
        }
     
        // If it is divisible
        if (sum % n == 0)
            return true;
     
        return false;
    }
     
    // Driver code
    public static void main (String[] args)
    {
        int n = 19;
     
        if (isPossible(n))
            System.out.println("Yes");
        else
            System.out.println("No");
     
    }
}
 
// This code is contributed by Ryuga
Python3



# Python 3 implementation of the approach
 
# Function that returns true if n divides
# the sum of the factorials of its digits
def isPossible(n):
     
    # To store factorials of digits
    fac = [0 for i in range(10)]
    fac[0] = 1
    fac[1] = 1
 
    for i in range(2, 10, 1):
        fac[i] = fac[i - 1] * i
 
    # To store sum of the factorials
    # of the digits
    sum = 0
 
    # Store copy of the given number
    x = n
 
    # Store sum of the factorials
    # of the digits
    while (x):
        sum += fac[x % 10]
        x = int(x / 10)
 
    # If it is divisible
    if (sum % n == 0):
        return True
 
    return False
 
# Driver code
if __name__ == '__main__':
    n = 19
 
    if (isPossible(n)):
        print("Yes")
    else:
        print("No")
 
# This code is contributed by
# Surendra_Gangwar
C#



// C# implementation of the approach
using System;
class GFG
{
     
    // Function that returns true if n divides
    // the sum of the factorials of its digits
    static bool isPossible(int n)
    {
     
        // To store factorials of digits
        int[] fac = new int[10];
        fac[0] = fac[1] = 1;
     
        for (int i = 2; i < 10; i++)
            fac[i] = fac[i - 1] * i;
     
        // To store sum of the factorials
        // of the digits
        int sum = 0;
     
        // Store copy of the given number
        int x = n;
     
        // Store sum of the factorials
        // of the digits
        while (x != 0)
        {
            sum += fac[x % 10];
            x /= 10;
        }
     
        // If it is divisible
        if (sum % n == 0)
            return true;
     
        return false;
    }
     
    // Driver code
    public static void Main ()
    {
        int n = 19;
     
        if (isPossible(n))
            Console.WriteLine("Yes");
        else
            Console.WriteLine("No");
    }
}
 
// This code is contributed by Code_Mech.
PHP



<?php
// PHP implementation of the approach
 
// Function that returns true if n divides
// the sum of the factorials of its digits
function isPossible($n)
{
 
    // To store factorials of digits
    $fac = array();
    $fac[0] = $fac[1] = 1;
 
    for ($i = 2; $i < 10; $i++)
        $fac[$i] = $fac[$i - 1] * $i;
 
    // To store sum of the factorials
    // of the digits
    $sum = 0;
 
    // Store copy of the given number
    $x = $n;
 
    // Store sum of the factorials
    // of the digits
    while ($x)
    {
        $sum += $fac[$x % 10];
        $x /= 10;
    }
 
    // If it is divisible
    if ($sum % $n == 0)
        return true;
 
    return false;
}
 
// Driver code
$n = 19;
 
if (isPossible($n))
    echo "Yes";
else
    echo "No";
 
// This code is contributed by Akanksha Rai
?>
Javascript



<script>
 
// JavaScript implementation of the approach
 
// Function that returns true if n divides
// the sum of the factorials of its digits
function isPossible(n)
{
     
    // To store factorials of digits
    var fac = new Array(10);
    fac[0] = fac[1] = 1;
 
    for(var i = 2; i < 10; i++)
        fac[i] = fac[i - 1] * i;
 
    // To store sum of the factorials
    // of the digits
    var sum = 0;
 
    // Store copy of the given number
    var x = n;
 
    // Store sum of the factorials
    // of the digits
    while (x != 0)
    {
        sum += fac[x % 10];
        x = parseInt(x / 10);
    }
 
    // If it is divisible
    if (sum % n == 0)
        return true;
 
    return false;
}
 
// Driver Code
var n = 19;
     
if (isPossible(n))
    document.write("Yes");
else
    document.write("No");
   
// This code is contributed by Khushboogoyal499
 
</script>
Output: 
Yes
 

My Personal Notes
arrow_drop_up
Previous
Centered hexagonal number
Next

Program to compare m^n and n^m
Recommended Articles
Page :
Find two co-prime integers such that the first divides A and the second divides B
09, Sep 19
Count of triplets (a, b, c) in the Array such that a divides b and b divides c
13, May 20
Check if the sum of digits of a number N divides it
25, Oct 18
Find last two digits of sum of N factorials
28, Oct 18
Check if the sum of digits of number is divisible by all of its digits
12, Sep 19
Count of prime digits of a Number which divides the number
03, Apr 20
Minimum number of Factorials whose sum is equal to N
24, Mar 20
Sum of the digits of square of the given number which has only 1's as its digits
20, Sep 19
Find N numbers such that a number and its reverse are divisible by sum of its digits
06, May 20
Numbers with sum of digits equal to the sum of digits of its all prime factor
20, Sep 18
Count of numbers in range [L, R] having sum of digits of its square equal to square of sum of digits
24, Aug 21
Find the unit place digit of sum of N factorials
28, Oct 18
Find sum of factorials in an array
24, Apr 19
Prefix Factorials of a Prefix Sum Array
01, Jun 21
Sum of factorials of Prime numbers in a Linked list
19, May 20
Find sum of factorials till N factorial (1! + 2! + 3! + ... + N!)
16, Dec 21
Check if a M-th fibonacci number divides N-th fibonacci number
11, Jul 18
Trailing number of 0s in product of two factorials
13, Jan 18
Find smallest number with given number of digits and sum of digits under given constraints
26, Jan 20
Smallest N digit number with none of its digits as its divisor
09, Jul 20
Check if sum of digits of a number exceeds the product of digits of that number
13, May 21
Count natural numbers whose factorials are divisible by x but not y
14, Jan 17
Calculating Factorials using Stirling Approximation
05, Jul 17
Queries for the product of first N factorials
24, Sep 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
pawan_asipu
@pawan_asipu
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!