Divisibility rules let you check if a number divides evenly without doing the division. They're the secret to fast factoring, simplifying and prime testing.
Here are the most useful rules from 2 to 11.
The everyday rules (2, 5, 10)
- 2: last digit is even.
- 5: ends in 0 or 5.
- 10: ends in 0.
Digit-sum rules (3 and 9)
- 3: the digit sum is a multiple of 3 (e.g. 123 → 1+2+3 = 6 ✓).
- 9: the digit sum is a multiple of 9.
Power-of-two rules (4 and 8)
- 4: the last two digits form a multiple of 4.
- 8: the last three digits form a multiple of 8.
The trickier ones (6, 7, 11)
- 6: divisible by both 2 and 3.
- 7: double the last digit, subtract from the rest; if the result is a multiple of 7, so is the number.
- 11: alternating digit sum is a multiple of 11.
Putting them to work
Use these to find the smallest prime factor fast, then confirm with the Prime Factorization Calculator or Prime Number Checker.
- Even last digit → divisible by 2; ends in 0/5 → by 5.
- Digit sum divisible by 3 or 9 → so is the number.
- Last two/three digits decide divisibility by 4/8.
- Divisible by 6 means divisible by both 2 and 3.
Prime Factorization Calculator
Confirm factors after using the rules.
Open the Prime Factorization CalculatorFrequently asked questions
What is the divisibility rule for 3?
Add the digits; if the sum is a multiple of 3, the number is divisible by 3. Example: 123 → 6, which is divisible by 3.
Is there a divisibility rule for 7?
Yes — double the last digit and subtract it from the remaining number. If the result is a multiple of 7, the original number is too.
How do divisibility rules help with factoring?
They quickly reveal small prime factors, so you can start a factor tree without trial-and-error division.
Math educators and engineers building free, accurate calculators with step-by-step solutions, visual diagrams and AI insights.
Related articles
How to Find the LCM: 4 Methods Explained (2026 Guide)
Learn how to find the Least Common Multiple (LCM) using four methods — prime factorization, the GCF formula, l…
How to Find the GCD Using the Euclidean Algorithm
The Euclidean algorithm finds the Greatest Common Divisor in just a few steps. Learn how it works, why it work…
How to Simplify Fractions Fast (Using the GCD)
Simplify any fraction to lowest terms in one step using the Greatest Common Divisor. Learn the method, see wor…