Divisibility Calculator — Check Divisibility Rules
Divisibility Results
--
Custom Divisor Result
--
How Divisibility Rules Work
Divisibility rules are mathematical shortcuts that determine whether one integer divides evenly into another without performing full long division. These rules leverage patterns in our base-10 number system — for example, any number ending in 0 or 5 is divisible by 5 because 10 itself is divisible by 5. According to the National Council of Teachers of Mathematics (NCTM), divisibility rules are a foundational number theory skill that supports fraction simplification, prime factorization, and algebraic reasoning.
This calculator tests divisibility by every integer from 2 through 12 and any custom divisor you enter, instantly showing which rules apply. Divisibility testing is used constantly in mathematics: simplifying fractions to lowest terms, finding common denominators, verifying prime numbers, and solving modular arithmetic problems in cryptography. For deeper number theory tools, try our Prime Factorization Calculator or GCD Calculator.
The Complete Divisibility Rules (2-12)
Each divisibility rule exploits a specific property of the number system. The general principle is: a number n is divisible by d if n mod d = 0 (the remainder is zero). The rules below provide mental shortcuts:
| Divisor | Rule | Example |
|---|---|---|
| 2 | Last digit is even (0,2,4,6,8) | 144: last digit 4 is even |
| 3 | Digit sum is divisible by 3 | 144: 1+4+4=9, 9/3=3 |
| 4 | Last two digits divisible by 4 | 144: 44/4=11 |
| 5 | Last digit is 0 or 5 | 145: ends in 5 |
| 6 | Divisible by both 2 and 3 | 144: even AND digit sum 9 |
| 7 | Double last digit, subtract from rest | 364: 36-2(4)=28, 28/7=4 |
| 8 | Last three digits divisible by 8 | 1,024: 024/8=3 |
| 9 | Digit sum is divisible by 9 | 144: 1+4+4=9, 9/9=1 |
| 10 | Last digit is 0 | 1,440: ends in 0 |
| 11 | Alternating digit sum divisible by 11 | 918082: 9-1+8-0+8-2=22 |
| 12 | Divisible by both 3 and 4 | 144: digit sum 9/3 AND 44/4 |
Key Terms You Should Know
Divisor (factor) — a number that divides another number exactly, with zero remainder. 6 is a divisor of 144 because 144 / 6 = 24 exactly. Every positive integer has at least two divisors: 1 and itself.
Modular arithmetic (mod) — a system of arithmetic where numbers "wrap around" after reaching a certain value (the modulus). "144 mod 7 = 4" means 144 divided by 7 leaves a remainder of 4. Modular arithmetic underpins cryptographic systems like RSA, which secures internet communications.
Prime number — an integer greater than 1 whose only divisors are 1 and itself. If a number fails all divisibility rules from 2 through its square root, it is prime. The first primes are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29. Test primes with our Prime Number Calculator.
Composite number — an integer greater than 1 that has at least one divisor other than 1 and itself. 144 is composite with divisors 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144. Every composite number can be expressed as a unique product of primes (the Fundamental Theorem of Arithmetic).
Practical Examples
Example 1 — Simplifying fractions: To simplify 144/360, test both numbers for common divisors. Both divisible by 2: 72/180. Both by 2 again: 36/90. Both by 2: 18/45. Both by 9 (digit sums: 1+8=9, 4+5=9): 2/5. The simplified fraction is 2/5. Knowing divisibility rules makes this process much faster than computing the GCD directly. Use our Fraction Calculator for automated simplification.
Example 2 — Checking a restaurant bill split: A dinner bill totals $247. Can it be split evenly among 6 people? Test: divisible by 2 (last digit 7 is odd) — No. Since 247 is not divisible by 2, it cannot be divisible by 6 (which requires both 2 and 3). Each person would pay $41.17. If the bill were $246, the digit sum 2+4+6=12 is divisible by 3, and 6 is even, so 246/6 = $41.00 exactly.
Example 3 — Verifying mental arithmetic: You calculate 37 x 24 = 888 in your head. Quick check: 888 should be divisible by both 37 and 24. Test for 24 (divisible by 8 AND 3): last three digits 888/8=111, and digit sum 8+8+8=24 which is divisible by 3. Confirmed. This technique catches multiplication errors in seconds.
Tips for Using Divisibility Rules
- Start with 2, 3, and 5: These three rules catch the majority of common factors. Test them first before moving to harder rules like 7 and 11.
- Use combined rules for 6 and 12: Divisibility by 6 = divisible by both 2 AND 3. Divisibility by 12 = divisible by both 3 AND 4. This avoids needing separate rules.
- The digit sum trick works recursively: If the digit sum is still large, sum its digits again. For 99,999: digit sum = 45, then 4+5 = 9, which is divisible by 9. So 99,999 is divisible by 9.
- For prime testing, only check up to the square root: To determine if 97 is prime, you only need to test divisors up to sqrt(97) = 9.8, meaning you check 2, 3, 5, and 7. None divide 97, so it is prime.
- Apply rules to fraction simplification: Before using the GCD algorithm, check both numerator and denominator for common small factors (2, 3, 5). This often simplifies the fraction in one or two steps.
Divisibility in Number Theory and Cryptography
Divisibility is the foundation of number theory, one of the oldest branches of mathematics dating back to ancient Greek mathematicians like Euclid. The American Mathematical Society considers the Fundamental Theorem of Arithmetic — that every integer greater than 1 has a unique prime factorization — as one of the central results in mathematics. Modern cryptography depends heavily on divisibility properties: RSA encryption works because finding the prime factors of large composite numbers (1,000+ digits) is computationally infeasible, even though verifying divisibility for known factors takes milliseconds. Every HTTPS connection on the internet relies on this asymmetry.
Frequently Asked Questions
What is the divisibility rule for 7?
To test divisibility by 7, double the last digit and subtract it from the remaining digits. If the result is divisible by 7 (or is 0), the original number is too. For 364: remove the 4, double it to 8, and subtract from 36: 36 - 8 = 28. Since 28 / 7 = 4, the number 364 is divisible by 7. For larger numbers, repeat the process: 1,001 becomes 100 - 2 = 98, then 9 - 16 = -7, which is divisible by 7. This rule was documented in the works of mathematician Martin Gardner.
How do you check divisibility by 11?
Compute the alternating sum of digits: add digits in odd positions, subtract digits in even positions (or vice versa). If the result is 0 or divisible by 11, the number is divisible by 11. For 918,082: 9 - 1 + 8 - 0 + 8 - 2 = 22, and 22 / 11 = 2, so 918,082 is divisible by 11. This rule works because 10 mod 11 = -1, meaning each successive digit position alternates between +1 and -1 in modular arithmetic. The rule extends to any size number.
Why are divisibility rules important in mathematics?
Divisibility rules enable rapid mental math, fraction simplification, and prime number identification without a calculator. They are essential for simplifying fractions to lowest terms (finding common factors quickly), checking arithmetic accuracy (a multiplication result should be divisible by both multiplicands), determining prime numbers (test divisors up to the square root), and understanding modular arithmetic used in cryptography. The NCTM includes divisibility rules in its core standards for grades 4-6.
How do you find all divisors of a number?
To find all divisors of a number, test every integer from 1 up to the square root of the number. Each time you find a divisor, its complement (the number divided by that divisor) is also a divisor. For 144: test 1 through 12 (since sqrt(144) = 12). Divisors found: 1, 2, 3, 4, 6, 8, 9, 12, and their complements 144, 72, 48, 36, 24, 18, 16, 12. Total: 15 divisors. Use our Prime Factorization Calculator to find divisors from the prime factorization.
What is the digit sum method and why does it work?
The digit sum method adds all the individual digits of a number together. If the sum is divisible by 3 or 9, the original number is too. For 729: 7+2+9 = 18, and 18 is divisible by both 3 and 9, so 729 is divisible by both. This works because 10 mod 9 = 1, meaning each power of 10 contributes exactly 1 to the remainder when divided by 9. Therefore, a number's remainder when divided by 9 equals the remainder of its digit sum divided by 9. The same logic applies to divisibility by 3 since 3 divides 9.
Is there a divisibility rule for any number?
Technically, divisibility rules can be constructed for any integer using modular arithmetic, but rules beyond 12 become increasingly complex and impractical for mental math. For composite divisors, combine rules: divisibility by 15 = divisible by both 3 AND 5; divisibility by 24 = divisible by both 3 AND 8. For large prime divisors, direct division or a calculator is more practical. The rules for 2-12 cover the vast majority of real-world mental math needs. For checking divisibility by large numbers, simply use the modulo operation on a calculator or this tool.