Remainder Calculator – Quotient and Remainder, Exact at Any Size

One division, four answers: quotient, remainder, fraction and decimal

Every division on this page gives four views of the same fact, and the table below, run through this page’s own calculator, shows them side by side. The quotient counts full groups, the remainder is what is left over, the fraction states the leftover as a share of the divisor, and the decimal shows the same information as a single number. Confusing them — especially the remainder with the decimal part — is where most division errors start.

The check that ties all four views together is the same on every row: divisor × quotient + remainder = dividend. For the default, 7 × 289 + 1 = 2,024; for 100 ÷ 7, 7 × 14 + 2 = 100; for the big division, 97 × 10,309,278 + 41 = 1,000,000,007. If that check fails, the quotient or the remainder is wrong, whichever view you were reading. The fraction view is the check in another form: the leftover 1 out of a divisor of 7 is exactly 1/7 of a full group, so 289 remainder 1 is 289 + 1/7, which is the decimal 289.142857… with the six digits 142857 repeating forever. Sevenths are famous for this cycle: 1/7, 2/7, 3/7, 4/7, 5/7 and 6/7 all repeat the same six digits in rotation (142857, 285714, 428571, 571428, 714285, 857142), which is why the table’s 5 ÷ 7 row shows 0.714285… — the same cycle starting at a different point. A remainder is therefore not an untidy leftover to be discarded; it is the numerator of the exact fraction, and the decimal is that fraction written out, repeating where it must.

The 5 ÷ 7 row deserves a pause, because it contradicts a common intuition that a remainder only appears when the divisor “fits”. When the divisor is larger than the dividend, the quotient is 0 and the remainder is the whole dividend: 5 ÷ 7 = 0 remainder 5, because 7 does not fit into 5 even once, so everything is left over. The fraction view makes this obvious — 5/7 is simply five sevenths — while the “leftover” language makes it sound like an error. The same logic applies to a zero dividend: 0 ÷ 7 = 0 remainder 0, nothing to group and nothing left over. And the big-division row shows why this page exists at all: ordinary calculators store numbers as binary floating point, exact only up to about 9 quadrillion (2⁵³ = 9,007,199,254,740,992, as this page’s own FAQ states), and a rounded dividend still gives a roughly right quotient while the remainder — the difference of two nearly equal quantities — inherits all of the rounding at full strength. The remainder 41 here is exact because this calculator works with whole numbers throughout, not with a rounded approximation of 1,000,000,007. If your remainder matters, the exactness of the inputs matters first.

Negative numbers: this calculator’s convention, stated plainly

For positive numbers, remainder and modulo are the same value, as this page’s own FAQ says. With negative numbers, conventions differ, and the table below states this calculator’s convention exactly, as probed from the engine itself. The rule is truncated division: the quotient is truncated toward zero, and the remainder takes the sign of the dividend, with a magnitude always smaller than the divisor.

Notice what stays constant across all three rows: the remainder’s sign follows the dividend (−17 gives −2 in both cases; 17 gives +2), never the divisor, and the quotient is the division truncated toward zero (−17 ÷ 5 is −3.4 truncated to −3, not floored to −4). The “leftover as a fraction” on this page uses absolute values — 2/5 in all three rows — because a fraction of a group is a size, not a signed quantity. The alternative convention, Euclidean modulo, always returns a non-negative remainder: −17 modulo 5 would be 3 under that convention (since −17 = 5 × (−4) + 3), which is a different answer to a different question. Neither convention is wrong; they answer different definitions of “leftover”. What matters is knowing which one your tool uses before you compare its answer with another tool’s, a programming language’s percent operator, or a textbook’s: most programming languages follow this calculator’s truncated convention, while clock arithmetic (25 modulo 12 is 1) follows the Euclidean habit of keeping remainders non-negative. If a remainder you computed elsewhere disagrees with this page by exactly the divisor, a convention difference — not an arithmetic error — is the first thing to check.

One more habit completes the picture. A remainder is always smaller than the divisor in magnitude — that is what “left over” means, since anything as large as another full group would have formed one. If you ever compute a remainder equal to or larger than the divisor, the quotient is too small by at least one: for example, claiming 100 ÷ 7 = 13 remainder 9 is wrong twice over, because 9 exceeds 7 and one more group of 7 fits inside it, giving the correct 14 remainder 2. The check divisor × quotient + remainder = dividend catches most errors, but the size check catches this one even faster, before any multiplication: a remainder must be smaller than the divisor, and under this calculator’s convention it must also carry the dividend’s sign. Hold both rules together and almost every remainder error announces itself.

When the remainder is zero: divisibility, and why it matters

A remainder of zero is the most informative answer this calculator can give, because it says the dividend splits into equal groups with nothing left over — the dividend is divisible by the divisor. The probed cases below show how divisibility clusters: a number can be divisible by one divisor and not by its neighbour, and the pattern is often visible in the digits themselves.

The digit rules behind the first rows are worth stating because they let you predict a zero remainder without dividing. A number is divisible by 3 when its digits sum to a multiple of 3, and by 9 when its digits sum to a multiple of 9: 2,025 has digits summing to 2 + 0 + 2 + 5 = 9, so it is divisible by both, and the calculator confirms both remainders are 0. A number is divisible by 4 when its last two digits form a multiple of 4 (100 ends in 00, which is 0), and by 8 when its last three digits form a multiple of 8 (2,024 ends in 024, which is 24, and 24 is 3 × 8). The 100 ÷ 8 row shows the limits of chaining these rules: divisibility by 4 does not imply divisibility by 8, because 8 needs one more factor of 2 than 4 does, and 100 has only two factors of 2 (100 = 4 × 25, and 25 is odd). The remainder, 4, is exactly the missing piece: 100 = 8 × 12 + 4, so one more group of 4 would be needed to reach the next multiple of 8.

Divisibility is not a parlour trick; it is how the remainder earns its keep in real arithmetic. Splitting a bill equally, dealing cards into equal hands, packing boxes, or checking whether a number is prime all reduce to asking whether some remainder is zero. A prime number, by definition, has no divisor other than 1 and itself that leaves remainder zero, so testing primality is testing remainders — and the big-division row in the main guide shows why exact remainder arithmetic matters there: 1,000,000,007 ÷ 97 leaves remainder 41, so 97 is not a factor of 1,000,000,007, and a floating-point calculator that rounded the dividend first could have reported a wrong remainder and therefore a wrong verdict on that question. Whenever a remainder of zero is the answer you need — divisible or not, factor or not — the remainder must be exact, because a remainder of zero is a sharp claim: one unit of error either way destroys it. That sharpness is also why the size check from the main guide matters: a claimed remainder of zero that came from a rounded input is not evidence of divisibility at all, only evidence that the rounding happened to land on a multiple.

Remainders in everyday grouping: weeks, hands and boxes

The most familiar remainder in daily life is the week. A year of 365 days is 52 weeks remainder 1 day (365 ÷ 7 = 52 remainder 1), which is why the same calendar date falls one weekday later the following year in a non-leap year — the extra day pushes every date forward by one. A hundred days is 14 weeks remainder 2 days (100 ÷ 7 = 14 remainder 2), so a hundred-day countdown that starts on a Monday ends on a Wednesday, two weekdays past fourteen whole weeks. The default division on this page, 2,024 ÷ 7 = 289 remainder 1, is the same pattern at a larger scale: 289 whole weeks and one day left over. Clock arithmetic is remainder arithmetic with divisor 12 or 24 or 60: 25 hours after noon is 1 o’clock, because 25 ÷ 12 = 2 remainder 1, and the remainder is the only part the clock shows. Whenever a quantity cycles — days into weeks, hours onto a clock face, items into boxes — the quotient counts whole cycles and the remainder names where you land inside the next one, which is why the remainder, not the quotient, is usually the answer people actually want.