Harshad Number Checker
Check whether a positive integer is divisible by the sum of its digits.
Description
Check whether a positive integer is divisible by the sum of its digits.
Check whether a positive integer is divisible by the sum of its digits.
When to use Harshad Number Checker
Use this tool to test or transform exact integers according to the named number-theory definition, for education, validation, or algorithm checks.
- Integer
- An integer input greater than or equal to 1.
How the calculation works
The formula below determines the tool output. Harshad number: Whether harshad number is true.1
n is Harshad when n mod digit-sum(n) = 0 Limitations and assumptions
This tool applies an exact integer definition within JavaScript's safe-integer range. It is not an arbitrary-precision factorization or proof system, so do not use rounded measurements or integers beyond the accepted domain as though they were exact.
Alternative or Complementary approaches
Complement a number-property result with its factorization, divisors, digit representation, or a second independent predicate. A true result establishes only the named property and does not imply other properties such as primality.
References
-
Harshad number — Wikipedia contributors
Similar or alternative tools
- Armstrong Number Checker
Check whether a nonnegative integer equals the sum of its digits each raised to the digit count.
- Automorphic Number Checker
Check whether the square of a nonnegative integer ends with the integer itself.
- Digit Count Calculator
Count the base-10 digits in a safe integer without counting its sign.