What Is the Is It a Multiple Calculator?
This tool tells you whether one number (N) is a multiple of another number (D). A number N is a multiple of D when dividing N by D produces a whole number with no leftover — in other words, when the remainder is zero. This is the same idea as asking "Is N divisible by D?" The calculator also shows the quotient and the remainder so you can see exactly how the division works out.
How to Use It
Enter the number you want to test as N, and the divisor as D. The calculator immediately reports "Yes" if N is a multiple of D, or "No" if it is not. Below the answer you'll find the floored quotient (N ÷ D rounded down) and the remainder (N mod D). If the remainder is 0, N is a multiple of D.
The Formula Explained
The core test is the modulo operation: $$\text{Is Multiple} \iff \left(\text{Number (N)} \bmod \text{Divisor (D)}\right) = 0$$ The modulo operator gives the remainder after division. For example, \(100 \bmod 5 = 0\), so 100 is a multiple of 5. By contrast, \(100 \bmod 7 = 2\), so 100 is not a multiple of 7. The quotient is \(q = \lfloor N \div D \rfloor\) and the remainder is \(r = N - qD\).
Worked Example
Is 100 a multiple of 5? Divide: \(100 \div 5 = 20\) with no remainder. Since \(100 \bmod 5 = 0\), the answer is Yes. The quotient is 20 and the remainder is 0. Now try 100 and 7: \(100 \div 7 = 14\) remainder 2, so \(100 \bmod 7 = 2 \neq 0\), and the answer is No.
Divisibility Rules for Common Divisors
These shortcuts let you test whether a whole number is a multiple of a small divisor without doing the full division. They apply to whole numbers written in the standard base-10 system.
| Divisor | Rule | Example |
|---|---|---|
| 2 | The last digit is even (0, 2, 4, 6, 8). | 348 ends in 8, so it is a multiple of 2. |
| 3 | The digit sum is divisible by 3. | 123 → 1+2+3 = 6, so yes. |
| 4 | The last two digits form a number divisible by 4. | 1316 → 16 is divisible by 4, so yes. |
| 5 | The last digit is 0 or 5. | 735 ends in 5, so yes. |
| 6 | The number is divisible by both 2 and 3. | 114 is even and 1+1+4 = 6, so yes. |
| 8 | The last three digits form a number divisible by 8. | 5128 → 128 = 8 × 16, so yes. |
| 9 | The digit sum is divisible by 9. | 729 → 7+2+9 = 18, so yes. |
| 10 | The last digit is 0. | 540 ends in 0, so yes. |
| 11 | The alternating digit sum is divisible by 11 (0 counts). | 121 → 1−2+1 = 0, so yes. 2728 → 2−7+2−8 = −11, so yes. |
Example Inputs and Results Compared
N is a multiple of D exactly when the remainder of N ÷ D is 0.
| N | D | Quotient | Remainder | Multiple? |
|---|---|---|---|---|
| 100 | 5 | 20 | 0 | Yes |
| 100 | 7 | 14 | 2 | No |
| 0 | 7 | 0 | 0 | Yes |
| 5 | 10 | 0 | 5 | No |
| 144 | 12 | 12 | 0 | Yes |
| 7 | 7 | 1 | 0 | Yes |
| -12 | 4 | -3 | 0 | Yes |
Two points worth remembering: 0 is a multiple of every non-zero number (0 = 0 × D), and every number is a multiple of itself (N = 1 × N). Negative numbers work the same way: -12 = (-3) × 4, so -12 is a multiple of 4. A divisor of 0 is not allowed, since division by zero is undefined.
FAQ
What if D is 0? Division by zero is undefined, so the calculator treats it as "not a multiple" and shows zero values.
Does it work with decimals? Yes, but multiples are most meaningful for whole numbers. The modulo still computes a remainder for decimals.
Is "multiple of" the same as "divisible by"? Yes. Saying N is a multiple of D is the same as saying N is divisible by D — both mean the remainder is zero.