Divisibility Checker
Check whether one integer evenly divides another and show the quotient and remainder.
About Divisibility Checker
An integer d divides n (written d | n) if there exists an integer q such that n = d × q, i.e. the remainder is zero. Divisibility is a fundamental concept in number theory underlying primes, factors, and modular arithmetic.
Formula
Divisibility
d | n ⟺ n mod d = 0 ⟺ n = d × q for some integer q
- n
- Dividend
- d
- Divisor
- q
- Quotient
Worked example
With the default values below, Divisibility Checker returns Evenly Divisible? of Yes. Change any input above and every figure here is recalculated in your browser.
Inputs used
- Dividend (n)
- 144
- Divisor (d)minimum 1
- 12
Results
- Evenly Divisible?
- Yes
- Quotient
- 12
- Remainder
- 0
Step by step
- 1Division
- 2Result= 12 divides 144 evenly
Assumptions and limits
- The result is derived only from the 2 inputs listed above. Anything not among them is not part of the calculation.
- In particular, this calculator does not take inflation, tax, fees or charges or compounding frequency into account.
- Figures are rounded for display to whole numbers, so totals built from several rounded parts can differ slightly from the unrounded arithmetic.
How these calculators are built and tested is described on the Methodology page. If a figure looks wrong, please report it.
Frequently Asked Questions
What does 'divisible' mean?
A number n is divisible by d if dividing n by d leaves zero remainder — the division is exact.
Is 0 divisible by every number?
Yes. For any non-zero d, 0 ÷ d = 0 with remainder 0, so d | 0.