{"id":532,"date":"2024-10-10T13:45:29","date_gmt":"2024-10-10T08:15:29","guid":{"rendered":"https:\/\/codexplained.in\/?p=532"},"modified":"2025-11-24T15:55:29","modified_gmt":"2025-11-24T10:25:29","slug":"checked-harshad-number","status":"publish","type":"post","link":"https:\/\/codexplained.in\/?p=532","title":{"rendered":"Checked Harshad Number"},"content":{"rendered":"
\n#include <stdio.h>\n\n\/\/ Function to calculate the sum of digits\nint sumOfDigits(int number) {\n    int sum = 0;\n    while (number > 0) {\n        sum += number % 10; \/\/ Add the last digit\n        number \/= 10;       \/\/ Remove the last digit\n    }\n    return sum;\n}\n\n\/\/ Function to check if a number is a Harshad number\nint isHarshad(int number) {\n    int sum = sumOfDigits(number);\n    return (sum != 0 && number % sum == 0); \/\/ Check divisibility\n}\n\nint main() {\n    int number;\n\n    printf("Enter a number: ");\n    scanf("%d", &number);\n\n    if (isHarshad(number)) {\n        printf("%d is a Harshad number.\\n", number);\n    } else {\n        printf("%d is not a Harshad number.\\n", number);\n    }\n\n    return 0;\n}\n\n<\/pre><\/div>\n\n\n
Explanation:<\/h3>\n\n\n\n
    \n
  1. sumOfDigits Function<\/strong>: This function calculates the sum of the digits of the given number.<\/li>\n\n\n\n
  2. isHarshad Function<\/strong>: This function checks if the number is divisible by the sum of its digits. It also ensures that the sum is not zero (to avoid division by zero).<\/li>\n\n\n\n
  3. main Function<\/strong>: This is the entry point of the program. It prompts the user to enter a number and uses the isHarshad<\/code> function to determine if it’s a Harshad number.<\/li>\n<\/ol>\n\n\n\n
    Output of the Given Code:<\/h2>\n\n\n
    \nEnter a number: 18\n18 is a Harshad number.\n\nEnter a number: 19\n19 is not a Harshad number.\n<\/pre><\/div>