Skip to content
Related Articles

Related Articles

Improve Article

Program to check if a number is divisible by sum of its digits

  • Last Updated : 29 Jul, 2021

Given an integer N, the task is to check whether the number is divisible by the sum of its digits or not. If divisible, then print “YES” else print “NO”.

Examples: 

Input: N = 12 
Output: YES
Explanation: 
    As sum of digits of 12 = 1 + 2 = 3
    and 12 is divisible by 3 
    So the output is YES

Input: N = 123
Output: NO

Approach: The idea to solve the problem is to extract the digits of the number and add them. Then check if the number is divisible by the sum of its digit. If it is divisible then print YES otherwise print NO.
Below is the implementation of above approach:

Implementation:  

C++




// C++ implementation of above approach
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to check
// if the given number is divisible
// by sum of its digits
string isDivisible(long long int n)
{
    long long int temp = n;
 
    // Find sum of digits
    int sum = 0;
    while (n) {
        int k = n % 10;
        sum += k;
        n /= 10;
    }
 
    // check if sum of digits divides n
    if (temp % sum == 0)
        return "YES";
 
    return "NO";
}
 
// Driver Code
int main()
{
    long long int n = 123;
 
    cout << isDivisible(n);
 
    return 0;
}
Java



// Java implementation of above approach
class GFG
{
 
    // Function to check if the
    // given number is divisible
    // by sum of its digits
    static String isDivisible(long n)
    {
        long temp = n;
     
        // Find sum of digits
        int sum = 0;
        while (n != 0)
        {
            int k = (int) n % 10;
            sum += k;
            n /= 10;
        }
     
        // check if sum of digits divides n
        if (temp % sum == 0)
            return "YES";
     
        return "NO";
    }
     
    // Driver Code
    public static void main(String []args)
    {
        long n = 123;
        System.out.println(isDivisible(n));
    }
}
 
// This code is contributed by Ryuga
Python3



# Python 3 implementation of above approach
 
# Function to check if the given number
# is divisible by sum of its digits
def isDivisible(n):
 
    temp = n
 
    # Find sum of digits
    sum = 0;
    while (n):
     
        k = n % 10;
        sum += k;
        n /= 10;
     
    # check if sum of digits divides n
    if (temp % sum == 0):
        return "YES";
 
    return "NO";
 
# Driver Code
n = 123;
 
print(isDivisible(n));
 
# This code is contributed by
# Akanksha Rai
C#



// C# implementation of above approach
using System;
 
class GFG
{
 
    // Function to check if the
    // given number is divisible
    // by sum of its digits
    static String isDivisible(long n)
    {
        long temp = n;
     
        // Find sum of digits
        int sum = 0;
        while (n != 0)
        {
            int k = (int) n % 10;
            sum += k;
            n /= 10;
        }
     
        // check if sum of digits divides n
        if (temp % sum == 0)
            return "YES";
     
        return "NO";
    }
     
    // Driver Code
    public static void Main()
    {
        long n = 123;
        Console.WriteLine(isDivisible(n));
    }
}
 
// This code is contributed by anuj_67..
PHP



<?php
// PHP implementation of above approach
 
// Function to check if the given number
// is divisible by sum of its digits
function isDivisible($n)
{
    $temp = $n;
 
    // Find sum of digits
    $sum = 0;
    while ($n)
    {
        $k = $n % 10;
        $sum += $k;
        $n = (int)($n / 10);
    }
 
    // check if sum of digits divides n
    if ($temp % $sum == 0)
        return "YES";
 
    return "NO";
}
 
// Driver Code
$n = 123;
print(isDivisible($n));
 
// This code is contributed
// by chandan_jnu
?>
Javascript



<script>
 
// Javascript implementation of above approach
 
// Function to check if the given number
// is divisible by sum of its digits
function isDivisible(n)
{
    temp = n;
 
    // Find sum of digits
    sum = 0;
     
    while (n)
    {
        k = n % 10;
        sum += k;
        n = parseInt(n / 10);
    }
 
    // Check if sum of digits divides n
    if (temp % sum == 0)
        return "YES";
 
    return "NO";
}
 
// Driver Code
let n = 123;
 
document.write(isDivisible(n));
  
// This code is contributed by sravan kumar
 
</script>
Output: 
NO
 
Method #2: Using string:
  • Convert the given number to a string by taking a new variable.
  • Traverse the string, Convert each element to integer and add this to sum.
  • If the number is divisible by sum then print Yes
  • Else print No
Below is the implementation of above approach:
Java



// Java implementation of above approach
class GFG{
     
static String getResult(int n)
{
     
    // Converting integer to String
    String st = String.valueOf(n);
 
    // Initialising sum to 0
    int sum = 0;
 
    // Traversing through the String
    for(char i : st.toCharArray())
    {
         
        // Converting character to int
        sum = sum + (int) i;
    }
     
    // Comparing number and sum
    if (n % sum == 0)
        return "Yes";
    else
        return "No";
}
 
// Driver Code
public static void main(String[] args)
{
    int n = 123;
     
    // Passing this number to get result function
    System.out.println(getResult(n));
}
}
 
// This code is contributed by 29AjayKumar
Python3



# Python implementation of above approach
def getResult(n):
   
    # Converting integer to string
    st = str(n)
     
    # Initialising sum to 0
    sum = 0
    length = len(st)
 
    # Traversing through the string
    for i in st:
 
        # Converting character to int
        sum = sum + int(i)
         
    # Comparing number and sum
    if (n % sum == 0):
        return "Yes"
    else:
        return "No"
 
 
# Driver Code
n = 123
# passing this number to get result function
print(getResult(n))
 
# this code is contributed by vikkycirus
Javascript



<script>
 
// JavaScript implementation of above approach
 
function getResult(n)
{
    // Converting integer to String
    let st = (n).toString();
  
    // Initialising sum to 0
    let sum = 0;
  
    // Traversing through the String
    for(let i of st.split(""))
    {
          
        // Converting character to int
        sum = sum + parseInt(i);
    }
      
    // Comparing number and sum
    if (n % sum == 0)
        return "Yes";
    else
        return "No";
}
 
// Driver Code
let n = 123;
      
// Passing this number to get result function
document.write(getResult(n)+"<br>");
 
// This code is contributed by unknown2108
 
</script>
Output:
No
Time Complexity: O(N)
Attention reader! Don’t stop learning now. Participate in the Scholorship Test for First-Step-to-DSA Course for Class 9 to 12 students.



My Personal Notes
arrow_drop_up
Previous
Sum of n digit numbers divisible by a given number
Next

Check if the sum of digits of number is divisible by all of its digits
Recommended Articles
Page :
Check if the sum of digits of number is divisible by all of its digits
12, Sep 19
Find N numbers such that a number and its reverse are divisible by sum of its digits
06, May 20
Program to check if a number is divisible by any of its digits
17, Jan 19
Check if sum of digits in the left half is divisible by sum of digits in the right half in the largest permutation of N
15, Jun 21
Check whether product of digits at even places is divisible by sum of digits at odd place of a number
19, Nov 18
Kth number exceeding N whose sum of its digits divisible by M
27, Oct 20
Even digits Sum and Odd digits sum divisible by 4 and 3 respectively
31, Aug 18
Numbers with sum of digits equal to the sum of digits of its all prime factor
20, Sep 18
Count of numbers between range having only non-zero digits whose sum of digits is N and number is divisible by M
13, Feb 19
Sum of the digits of square of the given number which has only 1's as its digits
20, Sep 19
Find a N-digit number such that it is not divisible by any of its digits
08, Apr 20
Find a N-digit number such that it is not divisible by any of its digits
26, Mar 20
Smallest number greater than or equal to N which is divisible by its non-zero digits
21, Dec 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
Numbers of Length N having digits A and B and whose sum of digits contain only digits A and B
31, Jan 19
Check whether sum of digits at odd places of a number is divisible by K
13, Nov 18
Check if a given number divides the sum of the factorials of its digits
01, Apr 19
Count numbers in range L-R that are divisible by all of its non-zero digits
26, Dec 17
Queries to count numbers from given range which are divisible by all its digits
28, Jan 21
Number of times a number can be replaced by the sum of its digits until it only contains one digit
16, Jul 17
Smallest number with given sum of digits and sum of square of digits
14, Jun 18
Find the index having sum of elements on its left equal to reverse of the sum of elements on its right
13, Jan 21
Find smallest number with given number of digits and sum of digits
06, Jun 16
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
sahilshelangia
@sahilshelangia
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