Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

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

  • Last Updated : 30 Jul, 2021

Given an integer N where 1 \leq n \leq 10^{18} . The task is to check whether the number is not divisible by any of its digit. If the given number N is divisible by any of its digits then print “YES” else print “NO”.

Examples: 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Input : N = 5115
Output : YES
Explanation: 5115 is divisible by both 1 and 5.
So print YES.

Input : 27
Output : NO
Explanation: 27 is not divisible by 2 or 7

Approach: The idea to solve the problem is to extract the digits of the number one by one and check if the number is divisible by any of its digit. If it is divisible by any of it’s digit then print YES otherwise print NO.



Below is the implementation of above approach: 

C++




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



// Java implementation of above approach
 
class GFG
{
 
    // Function to check if given number is divisible
    // by any of its digits
    static String isDivisible(int n)
    {
        int temp = n;
 
        // check if any of digit divides n
        while (n > 0)
        {
            int k = n % 10;
 
            // check if K divides N
            if (temp % k == 0)
            {
                return "YES";
            }
            n /= 10;
        }
 
        return "NO";
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        int n = 9876543;
        System.out.println(isDivisible(n));
    }
}
 
// This code is contributed by 29AjayKumar
Python3



# Python program implementation of above approach
 
# Function to check if given number is
# divisible by any of its digits
def isDivisible(n):
    temp = n
 
    # check if any of digit divides n
    while(n):
        k = n % 10
 
        # check if K divides N
        if(temp % k == 0):
            return "YES"
 
        n /= 10;
 
    # Number is not divisible by
    # any of digits
    return "NO"
 
# Driver Code
n = 9876543
print(isDivisible(n))
 
# This code is contributed by
# Sanjit_Prasad
C#



// C# implementation of above approach
using System;
 
class GFG
{
 
    // Function to check if given number is divisible
    // by any of its digits
    static String isDivisible(int n)
    {
        int temp = n;
 
        // check if any of digit divides n
        while (n > 0)
        {
            int k = n % 10;
 
            // check if K divides N
            if (temp % k == 0)
            {
                return "YES";
            }
            n /= 10;
        }
 
        return "NO";
    }
 
    // Driver Code
    public static void Main(String[] args)
    {
        int n = 9876543;
        Console.WriteLine(isDivisible(n));
    }
}
 
// This code is contributed by PrinciRaj1992
PHP



<?php
// PHP implementation of above approach
 
// Function to check if given number
// is divisible by any of its digits
function isDivisible($n)
{
    $temp = $n;
 
    // check if any of digit divides n
    while ($n)
    {
        $k = $n % 10;
 
        // check if K divides N
        if ($temp % $k == 0)
            return "YES";
 
        $n = floor($n / 10);
    }
 
    return "NO";
}
 
// Driver Code
$n = 9876543;
 
echo isDivisible($n);
 
// This code is contributed by Ryuga
?>
Javascript



<script>
 
// Javascript implementation of above approach
 
// Function to check if given number
// is divisible by any of its digits
function isDivisible(n)
{
    temp = n;
 
    // Check if any of digit divides n
    while (n)
    {
        k = n % 10;
 
        // Check if K divides N
        if (temp % k == 0)
            return "YES";
 
        n = Math.floor(n / 10);
    }
 
    return "NO";
}
 
// Driver Code
let n = 9876543;
 
document.write(isDivisible(n));
 
// This code is contributed by sravan kumar
 
</script>
Output: 
YES
 
Time Complexity: O(log(N)) 
Auxiliary Space: O(1)
Method #2: Using string:
  • We have to convert the given number to string by taking a new variable .
  • Traverse the string ,
  • Convert character to integer(digit)
  • Check if the number is divisible by any of it’s digit then print YES otherwise print NO.
Below is the implementation of above approach:
C++



//C++ implementation of above approach
#include <bits/stdc++.h>
using namespace std;
  
string getResult(int n)
 {
   
    // Converting integer to string
    string st = to_string(n);
     
    // Traversing the string
    for (int i = 0; i < st.length(); i++)
    {
       
        //find the actual digit
        int d = st[i] - 48;
        
      // If the number is divisible by
        // digits then return yes
        if(n % d == 0)
        {
           
            return "Yes";
        }
    }
   
    // If no digits are dividing the
    // number then return no
    return "No";
}
 
// Driver Code
int main()
{
int n = 9876543;
 
// passing this number to get result function
cout<<getResult(n);
 
}
 
// this code is contributed by SoumiikMondal
Java



// JAva implementation of above approach
import java.io.*;
 
class GFG{
static String getResult(int n)
 {
   
    // Converting integer to string
    String st = Integer.toString(n);
     
    // Traversing the string
    for (int i = 0; i < st.length(); i++)
    {
       
        //find the actual digit
        int d = st.charAt(i) - 48;
        
      // If the number is divisible by
        // digits then return yes
        if(n % d == 0)
        {
           
            return "Yes";
        }
    }
   
    // If no digits are dividing the
    // number then return no
    return "No";
}
 
// Driver Code
public static void main(String[] args)
    {
int n = 9876543;
 
// passing this number to get result function
System.out.println(getResult(n));
}
}
 
// this code is contributed by shivanisinghss2110
Python3



# Python implementation of above approach
def getResult(n):
   
    # Converting integer to string
    st = str(n)
     
    # Traversing the string
    for i in st:
       
        # If the number is divisible by
        # digits then return yes
        if(n % int(i) == 0):
            return 'Yes'
           
    # If no digits are dividing the
    # number then return no
    return 'No'
 
 
# Driver Code
n = 9876543
 
# passing this number to get result function
print(getResult(n))
# this code is contributed by vikkycirus
C#



// C# implementation of above approach
using System;
 
public class GFG{
static String getResult(int n)
 {
   
    // Converting integer to string
    string st = n.ToString();
     
    // Traversing the string
    for (int i = 0; i < st.Length; i++)
    {
       
        //find the actual digit
        int d = st[i] - 48;
        
      // If the number is divisible by
        // digits then return yes
        if(n % d == 0)
        {
           
            return "Yes";
        }
    }
   
    // If no digits are dividing the
    // number then return no
    return "No";
}
 
// Driver Code
public static void Main(String[] args)
{
   int n = 9876543;
 
   // passing this number to get result function
   Console.Write(getResult(n));
}
}
 
// this code is contributed by shivanisinghss2110
Javascript



<script>
 
// JavaScript implementation of above approach
 
function getResult(n)
{
    // Converting integer to string
    let st = n.toString();
      
    // Traversing the string
    for (let i = 0; i < st.length; i++)
    {
        
        //find the actual digit
        let d = st[i].charCodeAt(0) - 48;
         
      // If the number is divisible by
        // digits then return yes
        if(n % d == 0)
        {
            
            return "Yes";
        }
    }
    
    // If no digits are dividing the
    // number then return no
    return "No";
}
 
// Driver Code
let n = 9876543;
  
// passing this number to get result function
document.write(getResult(n));
 
// This code is contributed by unknown2108
 
</script>
Output:
Yes



My Personal Notes
arrow_drop_up
Next

Check if all digits of a number divide it
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
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
Program to check if a number is divisible by sum of its digits
21, Jan 19
Check whether product of digits at even places is divisible by sum of digits at odd place of a number
19, Nov 18
Given a number N in decimal base, find number of its digits in any base (base b)
12, Apr 18
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
Kth number exceeding N whose sum of its digits divisible by M
27, Oct 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
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
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
Reduce sum of any subset of an array to 1 by multiplying all its elements by any value
25, Feb 21
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
Check if sum of digits of a number exceeds the product of digits of that number
13, May 21
Count of numbers upto N digits formed using digits 0 to K-1 without any adjacent 0s
03, Jul 20
Check if any permutation of a large number is divisible by 8
31, Jul 18
Check if any large number is divisible by 19 or not
02, Oct 18
Check if any large number is divisible by 17 or not
02, Oct 18
Check if any permutation of a number is divisible by 3 and is Palindromic
16, Nov 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Sanjit_Prasad
@Sanjit_Prasad
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!