About the Integer Quotient and Remainder Calculator
Integer division splits a by b into a whole-number quotient q and a remainder r, with a = b × q + r and 0 ≤ r < |b| (Euclid's division lemma).
Calculate the integer quotient and remainder when dividing one whole number by another.
Log in or create a free account to save your inputs and results, so you don't have to enter them again next time.🔒 No spam, ever. We never sell or share your details, and you can delete your history or account at any time. Privacy policy
Fill in the details and click Calculate to see your results.

Integer division splits a by b into a whole-number quotient q and a remainder r, with a = b × q + r and 0 ≤ r < |b| (Euclid's division lemma).
| Dividend | 125 |
| Divisor | 12 |
| Quotient and remainder | 125 ÷ 12 = 10 remainder 5 |
| Quotient (q) | 10 |
| Remainder (r) | 5 |
| Division algorithm | 125 = 12 × 10 + 5 |
| Exact decimal | 10.41(6) |
125 ÷ 12 = 10 remainder 5.
Quotient 10, remainder 5, because 12 × 10 + 5 = 125.