Given an integer N, check whether the given number is a Moran Number or not. Moran numbers are a subset of Harshad numbers.
A number N is a Moran number if N divided by the sum of its digits gives a prime number. For example some Moran numbers are 18, 21, 27, 42, 45 and so on.
Input: N = 34 Output: No Explanation: 34 is not a moran number because it is not completely divisible 7 (sum of its digits). Input: N = 21 Output: Yes Explanation: 21 is a moran number because 21 divided by the sum of its digits gives a prime number.
Approach: To solve the problem mentioned above we have to find the sum of digits of that number. Then find the quotient by dividing the number by the sum of its digits and check if the quotient is a prime then the given number is a Moran Number. Below is the implementation of the above approach:
Please Login to comment...