How to use the remainder calculator
- Enter the dividend (the number being divided) and the divisor.
- Read the quotient and remainder, the mixed number and the exact decimal.
- Follow the long division steps digit by digit to check homework.
Division with remainder
dividend = divisor × quotient + remainder, 0 ≤ remainder < divisor
Example: 1,234 ÷ 7. 7 × 176 = 1,232, and 1,234 − 1,232 = 2, so 1,234 ÷ 7 = 176 R 2 = 176 2/7 ≈ 176.2857142857…, where the digits 285714 repeat forever.
Quick divisibility rules
| Divisible by | Rule |
|---|---|
| 2 | Last digit is even |
| 3 | Digit sum is divisible by 3 |
| 4 | Last two digits are divisible by 4 |
| 5 | Last digit is 0 or 5 |
| 6 | Divisible by both 2 and 3 |
| 9 | Digit sum is divisible by 9 |
| 10 | Last digit is 0 |
| 11 | Alternating digit sum is divisible by 11 |
Need the greatest common factor too? Try the LCM & GCF calculator.
Frequently asked questions
Divide and keep only the whole-number part of the answer (the quotient), multiply it back by the divisor, and subtract from the dividend. 47 ÷ 5: the quotient is 9, 9 × 5 = 45, and 47 − 45 = 2, so 47 ÷ 5 = 9 remainder 2.
Put the remainder over the divisor: 47 ÷ 5 = 9 R 2 = 9 2/5 = 9.4. The calculator shows all three, and marks repeating decimals with a bar, such as 1 ÷ 3 = 0.3̅.
Conventions differ. This calculator uses truncated division, like most programming languages' % operator: −7 ÷ 2 = −3 remainder −1. Mathematicians often prefer a remainder that's always positive (the modulo): −7 mod 2 = 1. Both are shown when they differ.
a mod n is the remainder after dividing a by n, usually taken as a number from 0 to n − 1. It's how clocks work: 14:00 is 2 o'clock because 14 mod 12 = 2. Programmers use it to check for even numbers (n mod 2 = 0) or to wrap around lists.