Skip to main content

How to find the number is Harshad number or not in C

How to find the number is Harshad number or not in C:-


In this program we will discuss of a number is a Harshad number or not in C programming. In mathematics, a Harshad number is a number that is divisible by the sum of its digits. We use a while loop statement with the following conditions. Input consists of 1 integer.

ALGORITHMS:-

Step 1- Enter the number to be check.
Step 2- store the number in a temporary variable.
Step 3- Initialise the while loop until the temp is not equal to zero
     (i) Calculate the remainder of the temp, divided with the 10 and store in digit
     (ii)  add the digit with sum and store it in the sum.
     (ii) divide the temp with the 10 and store in the temp;
Step 4- find the modulus of the number with sum and store in the res;
Step 5- if res equal to zero then a given number is a Harshad number else the given number is not a Harshad number.
Step 6- Stop.

  Code:-

#include<stdio.h>
int main()
{
     //To initialize of variable
     int number,temp,sum = 0, digit, res;
    printf("enter any number : "); 
    scanf("%d",&number);

    //store in temporary variable
    temp = number;
   //use while loop with this condition
   while(temp!=0)
   {
       //to find last digit
        digit=temp % 10;
      //sum+=digit
        sum = sum + digit;
     //temp/=10
        temp = temp / 10;
   }
   res = number % sum;
   //check result is equal is to 0
   if(res == 0)
      //display
       printf("%d is Harshad Number",number);
   else
      //display
      printf("%d is not Harshad Number",number);
  return 0;
} 



OUTPUT:-





FOLLOW AND SUBSCRIBE THIS WEBPAGE FOR 
 MORE NEW PROGRAMS AND CODING SOLUTIONS.
👈👈👈😉😉😉😉😉😉😉😉😉
Labels:

Comments

Post a Comment

Popular posts from this blog

Write a C program to find number is Abundant number or not

  Write a C program to find the number is an Abundant number or not:- In this program to find a number is an Abundant number or not. A number n is said to be an Abundant Number to follow these condition the sum of its proper di visors is greater than the number itself. And the difference between these two values is called abundance. Ex:-  Abundant number  12 having a proper divisor is 1,2,3,4,6 the sum of these factors is 16 it is greater than 12 so it is an Abundant number. Some other abundant numbers     18, 20, 24, 30, 36, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120.. ALGORITHMS:- Step 1 - Enter the number, to find the Abundant number. Step 2 - Initialize the loop with c=1 to c<=number and follow the following calculation      (i) check if whether the number is divisible with c and c got a result zero.      (ii) now sum=sum+c, add a digit into a sum and store it in the sum. Step 3 . then the...
Post a Comment
Read more

How to check if the given number is Even or odd-

1. How to check if the given number is Even or odd- We can determine whether a number is even or odd. This can be tested using different methods. The test can be done using simple methods such as testing the number’s divisibility by 2. If the remainder is zero, the number is even. If the remainder is not zero, then the number is odd. The following algorithm describes how a C program can test if a number is even or odd. CODE:- #include <stdio.h> int   main () { int num;//variable declaration printf("Enter any num: ");// take input from user  scanf("%d",&num);// declare input if(num%2==0) { printf("The num %d is even",num); } else { printf("The num %d is odd",num); } return 0; }     ALGORITHM:- Step 1.   Start Step 2 .   Enter a number. Step 3.   If...
3 comments
Read more

How to Check Whether a Number is Prime Number or Not in C

  How  to Check Whether a Number is Prime Number or Not in C:-  A number is considered as a prime number when it satisfies the below conditions.  A prime number is a number that can be divided by 1 and itself A number that can not be divided by any other number other than 1 or itself is a prime number. It should have only 2 factors. They are 1 and the number itself. ALGORITHMS:-                                               Step 1 . Read a “num” value to check prime or not. Step 2 . set i=1,div=0. Step 3 . if i<=num if true go to step 4, else go to step 7. Step 4 . Check the condition num%i==0 if true then evaluate step 5, else go to step...
Post a Comment
Read more