How this instrument works
A number is a divisor of another whenever it divides into that number with no remainder left over. This calculator tests exactly that: it computes the remainder left after dividing the number by the potential divisor, using the same long-division logic behind ⌊number ⁄ divisor⌋ × divisor subtracted from the original number. A remainder of exactly 0 means yes, the divisor fits perfectly; any other remainder means no.
This is the formal, precise version of the everyday phrase '4 goes into 20 evenly' — it genuinely means 20 ⁄ 4 leaves nothing over, the exact condition this test checks. Every whole number has at least two divisors trivially (1 and itself), and a number's complete list of divisors is the foundation for concepts like prime numbers (exactly two divisors), perfect numbers, and the greatest common divisor of two numbers.
This single yes-or-no test, applied repeatedly against every whole number from 1 up to a given number, is exactly how a full list of that number's divisors would be built by hand — checking each candidate one at a time for a remainder of zero.
- Enter the number you want to test as a potential divisor into the Potential divisor field.
- Enter the number being divided into the Number field.
- Read the remainder: exactly 0 means the divisor fits evenly; any other value means it doesn't.
Worked example — does 4 divide 20?
Testing whether 4 divides 20: the remainder comes out to exactly 0, since 20 ⁄ 4 = 5 exactly — YES, 4 is a divisor of 20. This matches the intuitive check: 4, 8, 12, 16, 20 — five complete steps of 4 land exactly on 20.
Testing whether 3 divides 20 instead: the remainder comes out to 2, since 3 fits into 20 six whole times (18) with 2 left over — NO, 3 is not a divisor of 20. The distinction between these two results is exactly the difference between a clean, even split and one that leaves something behind.
Questions
What does it mean for one number to divide another evenly?
It means dividing the larger number by the smaller one leaves no remainder at all — the smaller number fits into the larger a whole number of times exactly, with nothing left over.
How do you test if a number is a divisor?
Divide the number by the candidate divisor and check the remainder: subtract off the largest whole number of complete divisor-sized groups that fit, and see what's left. A remainder of exactly zero confirms it divides evenly.
What are the trivial divisors of a number?
Every whole number greater than 1 has at least two divisors trivially: 1 (which divides everything) and the number itself (which always divides itself evenly). Numbers with EXACTLY those two divisors and no others are called prime.
How is this related to finding the GCD of two numbers?
The greatest common divisor is the largest number that passes this exact divisibility test against BOTH of two given numbers simultaneously — finding it by hand would mean checking every candidate divisor of the smaller number against the larger one, though the Euclidean algorithm finds it far more efficiently.
Can zero be tested as a divisor?
No — dividing by zero has no defined result, so zero cannot be used as the potential divisor in this test. Zero itself, however, is divisible by every nonzero number, since 0 divided by anything leaves a remainder of 0.