Divisibility Checker
Check whether one integer evenly divides another and show the quotient and remainder.
Inputs
The number to be divided.
The number to divide by.
Evenly Divisible?
Yes
Quotient
12
Remainder
0
Step by step
Division
144 ÷ 12 = 12 remainder 0
Result
= 12 divides 144 evenly
How it works
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
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.