Divide 22 by 5 and a calculator says 4.4 — but how many whole groups of 5, and what is left over? This Remainder Calculator answers in the form long division intends: quotient 4, remainder 2, with the verification identity printed underneath so you can check the result in one line.
Worked Example: 22 ÷ 5
The calculator reports quotient 4, remainder 2, and the check line reads 22 = 5 × 4 + 2. Five fits into 22 four whole times (using 20), and 2 is left over — smaller than the divisor, as a remainder must be. As a decimal that same split is 4 + 2/5 = 4.4, which is where the familiar decimal answer comes from: the remainder over the divisor is the fractional part. Whenever a problem asks about leftovers, groups, or cycles, the quotient-remainder form is the one that answers it; the decimal buries exactly the information you need.
The Division Algorithm
For any integers a (dividend) and b (divisor, not zero), there exist unique integers q and r with a = bq + r and 0 ≤ r < |b|. That uniqueness is why "the remainder" is well-defined, and the identity a = bq + r is a complete check: multiply back, add the remainder, and you must land on the dividend. The remainder operation — written a mod b in mathematics and computing — is the same r. Clock arithmetic is mod 12 (or 24): 22 mod 12 = 10, which is why 22:00 is 10 PM. Congruence builds on it: a ≡ a′ (mod b) means a and a′ share a remainder, the foundation of checksums, hashing and calendar math — the day of the week cycles with mod 7, which is why a date 22 days out lands one weekday later (22 mod 7 = 1).
Where Quotients and Remainders Matter
Sharing and packing: 22 candies among 5 children is 4 each with 2 left over — the remainder is the fairness problem, not a rounding error. Unit conversion: 22 inches is 1 foot (quotient) and 10 inches (remainder) — mixed units are quotient-remainder pairs. Computing: the % operator returns this remainder, driving everything from even/odd tests (n mod 2) to wraparound buffers and ISBN check digits. Scheduling: rotating shifts and repeating patterns all reduce times modulo the cycle length. In every setting the recipe is identical: divide, keep both outputs, and verify with bq + r.
Common Mistakes
Reporting the decimal tail as the remainder: for 22 ÷ 5 the remainder is 2, not 0.4 — the 0.4 is the remainder divided by the divisor. Accepting a remainder larger than the divisor, which means the quotient can still grow. Dividing by zero, which has no quotient or remainder at all. And sign confusion with negatives: mathematics keeps the remainder non-negative (−22 = 5 × (−5) + 3, so the remainder of −22 ÷ 5 is 3), while some programming languages return −2 — know which convention your tool uses; this calculator follows the mathematical one for positive divisors.
Remainders at Work: Calendars and Check Digits
Weekday arithmetic is remainder arithmetic. If today is Wednesday, what weekday falls 100 days from now? Only the remainder matters: 100 = 7 × 14 + 2, so 100 mod 7 = 2, and the answer is two weekdays later — Friday. Whole weeks vanish from the computation entirely, which is exactly what a remainder is for. Check digits push the same idea into error detection. The ISBN-10 system weights a book’s first nine digits by 10 down to 2 and chooses the tenth digit so the total is divisible by 11 — remainder zero. The classic example 0-306-40615-2 gives the weighted sum 0 + 27 + 0 + 42 + 24 + 0 + 24 + 3 + 10 + 2 = 132 = 12 × 11, remainder 0, valid. Mistype any single digit and the weighted sum shifts by a non-multiple of 11, the remainder check fails, and the error is caught before it propagates — remainders standing guard over data. Credit cards (the Luhn algorithm, mod 10), bank routing numbers (mod 9 and mod 10 variants) and barcode UPCs all run some descendant of this exact scheme.
Negative Dividends, Handled Carefully
Remainders of negatives are where conventions diverge, so they deserve one careful paragraph. The mathematical convention keeps the remainder in the range 0 ≤ r < divisor by letting the quotient round toward negative infinity: −22 divided by 5 gives quotient −5 and remainder 3, because −22 = 5 × (−5) + 3 with 3 in range. Many programming languages instead truncate toward zero and report remainder −2. Both are self-consistent; they answer to different quotient choices, and the identity a = bq + r holds in each. This calculator follows the mathematical convention for its mod output when the divisor is positive — the convention under which clock arithmetic, congruence classes and calendar math behave most smoothly. Whichever convention a tool uses, the identity check printed under the result is the arbiter: if divisor × quotient + remainder does not rebuild the dividend exactly, something was mis-entered.
What Remainders Can and Cannot Be: A Famous Consequence
Restrict attention to the remainders a perfect square can leave, and remainders start proving theorems. Modulo 4, an even number 2k squares to 4k², remainder 0; an odd number 2k + 1 squares to 4k(k + 1) + 1, remainder 1. So every square is ≡ 0 or 1 (mod 4) — never 2 or 3. Add two squares and the possible remainders are only 0, 1 or 2, never 3: therefore no number that leaves remainder 3 on division by 4 — not 7, not 11, not 19, not 2027 — can be written as a sum of two perfect squares, a genuine impossibility proof built from nothing but remainders of division by 4. The same game modulo other divisors maps out which remainders cubes, fourth powers and primes can take, and a large part of elementary number theory is this game played expertly. The calculator’s humble r is, quite literally, the raw material of proofs.
The Polynomial Cousin: The Remainder Theorem
Division with remainder is not only for integers. Divide a polynomial P(x) by (x − a) and the remainder is a constant — and the remainder theorem identifies it without dividing: the remainder equals P(a). For P(x) = x² − 3x + 5 and a = 2: P(2) = 4 − 6 + 5 = 3, and indeed x² − 3x + 5 = (x − 2)(x − 1) + 3, remainder 3 as promised. Setting the remainder to zero gives the factor theorem — (x − a) is a factor exactly when P(a) = 0 — which is the engine behind solving polynomial equations by testing candidate roots. Integer remainders, polynomial remainders, clock arithmetic: one division algorithm, many costumes.
Related Tools
Continue with the Factor Calculator, the Cross Multiplication Calculator, the Reciprocal Calculator, or browse the full Math Calculators hub.
Frequently Asked Questions
What is the remainder of 22 divided by 5?
Two. Five goes into 22 four times (20), leaving 22 − 20 = 2, and the check reads 22 = 5 × 4 + 2.
Can a remainder be bigger than the divisor?
No. If the remainder were at least the divisor, the quotient could increase by 1. A valid remainder always satisfies 0 ≤ r < divisor.
How is the remainder related to the decimal answer?
Decimal = quotient + remainder/divisor. For 22 ÷ 5 that is 4 + 2/5 = 4.4 — the decimal and the quotient-remainder pair carry the same information.
What does “mod” mean?
a mod b is the remainder when a is divided by b. 22 mod 5 = 2, and 22 mod 12 = 10 — the same operation that runs clock arithmetic.
What is the remainder when the dividend is smaller than the divisor?
The dividend itself, with quotient 0: 3 ÷ 5 gives quotient 0 and remainder 3, since 3 = 5 × 0 + 3.
Why does the check identity matter?
Because dividend = divisor × quotient + remainder must hold exactly. If it does not, one of the three numbers is wrong — it is a complete one-line verification.