Remainder Calculator — what's left after dividing

The remainder calculator above answers one narrow question precisely: when you divide one whole number by another, what is left over? It returns the remainder as the headline figure, the whole quotient beside it, the leftover expressed as a fraction of the divisor, the decimal equivalent, and a plain yes-or-no on whether the division comes out exactly. It also shows the verification line — divisor times quotient plus remainder — substituted with your own numbers, so you can see why the answer is right rather than taking it on trust.

Arb Digital publishes this alongside a set of arithmetic tools because remainders show up far outside the classroom. They drive calendar maths, cryptography, checksum digits, alternating rota schedules, packing and shipping calculations, and every "how many full boxes and how much is left" question in inventory management. This page covers the mechanics, and it also handles the part that trips up programmers and students alike: what a remainder means when one of the numbers is negative.

What This Remainder Calculator Does

Enter a dividend and a non-zero divisor. The calculator performs whole-number division and reports the remainder using whichever convention you select. For positive inputs there is only one sensible answer and all three conventions agree, so you can ignore the selector entirely. For negative inputs the three options genuinely differ, and the calculator names each convention so you can match whatever system you are working in — a pocket calculator, a spreadsheet, or a specific programming language.

The supporting grid adds context the raw remainder cannot give you on its own. The remainder as a fraction shows the leftover relative to the divisor, which is the only fair way to judge whether a remainder is large or small. The decimal quotient gives the same information in decimal form. The last cell states whether the divisor divides the dividend exactly, which is the same as asking whether the remainder is zero.

If you want to see the division itself worked out digit by digit rather than just the leftover, use our long division calculator, which renders the full bracket layout with every bring-down and subtraction. This page is deliberately narrower: it is about the remainder and the conventions that govern it.

How to Use It

1. Enter the dividend. The number being divided. In "137 divided by 8", the dividend is 137.
2. Enter the divisor. The number you are dividing by. Zero is rejected, because dividing by zero has no defined result.
3. Pick a convention if either number is negative. Truncated matches most handheld calculators and languages like C, Java and JavaScript. Floored matches Python and most spreadsheet MOD functions. Euclidean always returns a non-negative remainder.
4. Read the working line. It substitutes your numbers into divisor × quotient + remainder = dividend so you can confirm the arithmetic.
5. Check the fraction cell when you need to know whether the leftover is significant relative to the divisor.

The Formula and How It's Calculated

Every whole-number division satisfies one identity, known as the division algorithm: dividend = divisor × quotient + remainder. With the default values, 137 ÷ 8 gives a quotient of 17 and a remainder of 1, because 8 × 17 = 136 and 137 − 136 = 1. Substituting: 8 × 17 + 1 = 137, which returns the original dividend, so the pair is correct. The remainder as a fraction is 1/8, and the decimal quotient is 17.125 — the .125 being exactly 1 ÷ 8.

The constraint that makes the answer unique is that the remainder must satisfy 0 ≤ remainder < divisor. Without that rule you could write 137 = 8 × 16 + 9 and call 9 a remainder, which is arithmetically true but not useful, because 9 still contains another whole 8. The formal statement of this uniqueness result is set out in MathWorld's entry on the division algorithm. In practice, the rule gives you a free error check: if your remainder is not strictly smaller than your divisor, your quotient is too small.

Negative Numbers: Why Two Calculators Disagree

Ask two different tools for −137 remainder 8 and you can legitimately get −1 or 7. Neither is broken. The disagreement comes from how the quotient is rounded before the remainder is worked out. Truncated division rounds the quotient toward zero: −137 ÷ 8 is −17.125, truncated to −17, giving a remainder of −137 − (8 × −17) = −137 + 136 = −1. Floored division rounds the quotient down toward negative infinity: −17.125 floors to −18, giving −137 − (8 × −18) = −137 + 144 = 7.

Both satisfy the identity, so both are internally consistent. The practical difference is the sign: truncated remainders take the sign of the dividend, floored remainders take the sign of the divisor, and the Euclidean convention forces the remainder to be non-negative regardless. Which one you want depends entirely on context. If you are wrapping an index around a circular buffer, a clock face or a colour wheel, you almost always want the non-negative version, because an index of −1 is not a position on the wheel. If you are matching the behaviour of a specific language or spreadsheet, pick the convention that language uses and stay consistent.

This is a real source of bugs. C, Java, JavaScript, Go and Rust use truncated remainders, so their percent operator can return a negative value. Python and Ruby use floored, so their percent operator matches the sign of the divisor. Spreadsheet MOD functions generally follow the floored convention too. Code that assumes one behaviour and runs in a language using the other will pass every test with positive inputs and fail silently the first time a negative appears.

Remainders in Everyday Problems

Calendar arithmetic is pure remainder work. Days of the week repeat every 7, so if today is Tuesday, the day 137 days from now is found by taking 137 remainder 7 = 4, then counting four days forward from Tuesday to reach Saturday. Clocks work the same way with 12 or 24, and any repeating rota — a four-week shift pattern, a five-person on-call rotation — is answered by dividing the elapsed count by the cycle length and reading the remainder.

Packing problems are the other big family. If you have 137 items and each carton holds 8, you fill 17 cartons and 1 item is left over, which almost always means you need an 18th carton. The remainder tells you not just that there is a leftover but exactly how empty that final carton will be — one item out of eight, a carton that is 12.5% full. That is the sort of detail that drives real packaging decisions. Our rounding calculator is useful alongside this when you need to decide whether to round the container count up or down.

Divisibility Rules You Can Do in Your Head

You often do not need the full division to know whether the remainder will be zero. A number is divisible by 2 if its last digit is even, and by 5 if it ends in 0 or 5. It is divisible by 4 if its last two digits form a multiple of 4, and by 8 if its last three do. It is divisible by 3 if the sum of its digits is a multiple of 3, and by 9 if the digit sum is a multiple of 9 — and better still, the remainder when dividing by 9 equals the remainder of the digit sum divided by 9. Our digit sum calculator automates that test.

For 11, alternately add and subtract the digits and check whether the result is a multiple of 11. For 6, test 2 and 3 together. These rules are not party tricks; they are a fast filter when you are checking whether a total splits evenly, and they catch data-entry errors before you commit to a longer calculation. Testing whether a number has any divisors at all is a related question, handled by our prime number checker.

Modular Arithmetic and Why Remainders Matter Beyond School

Working only with remainders after dividing by a fixed number is called modular arithmetic, formally described through MathWorld's definition of congruence, and it is the backbone of a surprising amount of technology. Check digits on ISBNs, bank account numbers and credit cards are computed as remainders, which is why a single mistyped digit is caught immediately. Hash tables map keys into buckets using a remainder. Public-key cryptography, including the RSA algorithm that protects a large share of internet traffic, is built entirely on arithmetic performed modulo very large numbers.

The useful property is closure: remainders behave predictably under addition and multiplication. If you only care about the remainder of a sum, you can reduce each part first and add the reduced values, then reduce again. That means you never need to compute an enormous intermediate number to know its remainder — which is exactly what makes modular arithmetic practical for machines handling values with hundreds of digits. Our number base converter touches the same territory, since converting a number into another base is repeated division with remainder recording.

Common Mistakes to Avoid

• Assuming a negative remainder is a bug. It is a convention, not an error. Decide which convention your situation needs before deciding the answer is wrong.
• Reading the remainder as decimals. "17 remainder 1" is not 17.1. The decimal tail is remainder divided by divisor, which here is 1 ÷ 8 = 0.125.
• Comparing remainders from different divisors. A remainder of 3 out of 4 is nearly a whole unit; a remainder of 3 out of 500 is negligible. Convert to a fraction before comparing.
• Leaving a remainder that is too large. If the remainder is greater than or equal to the divisor, the divisor fits at least once more and the quotient needs increasing.
• Using a remainder where you need a ceiling. Boxes, coaches and pages usually need the quotient rounded up whenever any remainder exists at all.

Related Free Tools From Arb Digital

To see the division written out step by step, use the long division calculator. Turn a remainder into a simplified fraction with the fraction calculator, or find common factors with the LCM and GCF calculator. The prime number checker tests whether a number has divisors other than one and itself, and the digit sum calculator gives you instant divisibility tests for 3 and 9. See the full free online tools hub for everything else.

Frequently Asked Questions