Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools


Divisibility Rules






Testing Divisibility at a Glance

Checking whether one number divides another by performing the full division works — but it is slow, especially for large numbers. For the most common divisors, patterns in the decimal digits provide an answer instantly. Each pattern is a consequence of how modular arithmetic interacts with the base-1010 place value system, compressed into a rule simple enough to apply mentally.

Key Terms

Divisor (Factor)— what each rule tests for
Multiple— a number passing a rule is a multiple of that divisor
Coprime— required when combining rules for composite divisors

See All Arithmetic Definitions →


What Are Divisibility Rules?

Is 7,836 divisible by 3 — and can that be told without doing the division?
Long division answers the question, but it takes several steps and is easy to slip on. Perhaps the digits themselves carry a quicker sign.
Adding the digits and testing the small sum gives the same verdict as the division every time.
numberlong division by 3sum of digitsdigit sum divisible by 3?
7,8362,612 remainder 07 + 8 + 3 + 6 = 24yes
1,234411 remainder 11 + 2 + 3 + 4 = 10no
5,0011,667 remainder 05 + 0 + 0 + 1 = 6yes
9832 remainder 29 + 8 = 17no
In each row the digit sum and the division agree: 7,8367{,}836 and 5,0015{,}001 are divisible by 33, while 1,2341{,}234 and 9898 are not — and the digit sum took one line instead of a full division.
The verdict can be read from the digits because of the way base-10 numbers are built.
Every rule exploits the structure of base-1010 representation. A number like 5,4325{,}432 is shorthand for 5⋅103+4⋅102+3⋅10+25 \cdot 10^3 + 4 \cdot 10^2 + 3 \cdot 10 + 2. The behavior of the powers of 1010 under modulo determines which digit patterns reveal divisibility — and different divisors respond to different patterns.
The definition
A divisibility rule is a shortcut that decides whether a number is divisible by a given divisor by looking at its digits, without carrying out the division.
A divisibility rule is a shortcut that determines whether a number is divisible by a given divisor without carrying out the division. Instead of computing 7,836÷37{,}836 \div 3 and checking for a remainder, the rule says: add the digits 7+8+3+6=247 + 8 + 3 + 6 = 24, and check whether that sum is divisible by 33. It is, so 3∣78363 \mid 7836.
So "add the digits and test the sum" is the divisibility rule for 33, and it shows that 3∣78363 \mid 7836.
A rule is a fast path to the same yes-or-no answer the definition gives — not a new definition.
The rules are shortcuts, not definitions. The definition of divisibility is a∣ba \mid b when b=a⋅kb = a \cdot k for some integer — equivalently, when b mod a=0b \bmod a = 0. The rules provide fast paths to that same conclusion.
Each divisor has its own rule, and a rule for one divisor says nothing about another.
The digit-sum test works for 33 and 99, not for 77: 1616 has digit sum 77, yet 77 does not divide 1616. The rules divisor by divisor start with divisibility by 2, and the reasons behind them are collected in why these rules work.
The rest of the page covers the rules for 2, 3, 4, 5, 6, 8, 9, 10 and 11, combining rules, worked examples, and why the rules work.

Divisibility by 2

RULE
A number is divisible by 22 if its last digit is even: 0,2,4,60, 2, 4, 6, or 88.

Since 1010 is divisible by 22, every power of 1010 is also divisible by 22. The contribution of each digit beyond the ones place — d⋅10kd \cdot 10^k for k≥1k \geq 1 — is automatically a multiple of 22. Only the final digit d0d_0 remains outside that guarantee, so d0d_0 alone determines divisibility.

The number 1,7461{,}746 ends in 66 (even), so 2∣17462 \mid 1746, as the figure below shows.
Divisibility by 2: last 1 digits of 1746The last 1 digits of 1746 form 6, which is divisible by 2.17466divisible by 2?check the last digit6 is even2 | 1746
The number 3,8213{,}821 ends in 11 (odd), so 2∤38212 \nmid 3821.

The even numbers — …,−4,−2,0,2,4,6,…\ldots, -4, -2, 0, 2, 4, 6, \ldots — are precisely the integers divisible by 22. The odd numbers are those that leave a remainder of 11.
÷1÷2÷3÷4÷5÷6÷7÷8÷9÷10÷11÷12✕0123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
The ÷2 column: every other number

Down the highlighted column every second number is marked, and their last digits run 0, 2, 4, 6, 8 and repeat: the rule for 2 is the pattern of that column read off the ones place. Nothing about the higher digits matters. Scan the column for any range of numbers on the interactive divisibility table.

The rule for 5 and the rule for 10 read the same digit in the same way.

Divisibility by 3

RULE
A number is divisible by 33 if the sum of its digits is divisible by 33.

The reason traces to a single congruence: 10≡1(mod3)10 \equiv 1 \pmod{3}. Every power of 1010 is also congruent to 11 modulo 33: 102≡110^2 \equiv 1, 103≡110^3 \equiv 1, and so on. A digit dd in the kkth place contributes d⋅10k≡d⋅1=d(mod3)d \cdot 10^k \equiv d \cdot 1 = d \pmod{3}. The place value drops away entirely, and only the digit itself matters. The number is congruent to the sum of its digits modulo 33.
The reason for the rule as a chain of congruences modulo 33, from the one fact about 1010 to the share of a single digit.
DownloadPNG2×PDF
ProveA number is divisible by 33 if the sum of its digits is divisible by 33.
1
10≡1(mod3)10 \equiv 1 \pmod{3}
baseThe single congruence the rule traces to
2
102≡110^2 \equiv 1, 103≡110^3 \equiv 1, and so on
powersEvery power of 1010 is also congruent to 11 modulo 33
3
d⋅10k≡d⋅1d \cdot 10^k \equiv d \cdot 1
one digitA digit dd in the kkth place, with its place value
4
=d(mod3)= d \pmod{3}
key stepThe place value drops away entirely, and only the digit itself matters
The number is congruent to the sum of its digits modulo 33
Why the rule for 3 worksLearn Math Class
Once every power of 1010 counts as 11, the place value of each digit drops away, and that last line is where the rule comes from.
The number 729729 illustrates the rule: 7+2+9=187 + 2 + 9 = 18, and 1+8=91 + 8 = 9. Since 3∣93 \mid 9, the number is divisible by 33 — as shown below.
Divisibility by 3: digit sum of 729The digits of 729 sum to 18, which is divisible by 3.729++18divisible by 3?sum the digits7 + 2 + 9 = 181 + 8 = 93 | 729
Pitfall: Testing 3 by the last digit
Judging by the last digit, 2,1432{,}143 passes because it ends in 33, yet its digit sum 1010 fails and 2143=3⋅714+12143 = 3 \cdot 714 + 1. And 1,2571{,}257 ends in 77, but 1+2+5+7=151 + 2 + 5 + 7 = 15, so 3∣12573 \mid 1257.

The number 1,2341{,}234: 1+2+3+4=101 + 2 + 3 + 4 = 10, and 1+0=11 + 0 = 1. Since 3∤13 \nmid 1, the number is not divisible by 33.

The process can be repeated: if the digit sum is large, sum its digits again. The chain always terminates at a single digit, and that digit determines divisibility.
126Even or Odd?EVENEVEN÷2 ✓✓÷4?26✗✓÷8?✗÷8 ✗✗ODD÷2,4,6,8,10,12 ✗↓ merge÷3?sum=9✓÷3 ✓÷9?✓÷3 ✗÷9 ✗÷5?ends 6✗÷7?✓÷11?alt=5✗DERIVED÷6(2∧3)÷10(2∧5)÷12(3∧4)
126: digit sum 9, so divisible by 3 and by 9

The tree tests 126 rule by rule: even, so ÷2 passes; 26 is not a multiple of 4, so ÷4 fails; the digit sum 1 + 2 + 6 = 9 is divisible by 3 and by 9, so both of those tests pass. The digit-sum test is the rule of this section carried out as one branch. Send any number down the tree on the divisibility decision tree.

The rule for 9 is the same test with a stricter target, as the tree’s next question shows.

Divisibility by 4

RULE
A number is divisible by 44 if its last two digits form a number divisible by 44.

The number 100100 is divisible by 44, and so is every higher power of 1010. Every digit beyond the tens place contributes a multiple of 100100 — automatically a multiple of 44. Only the last two digits affect the remainder when dividing by 44.

The number 3,5163{,}516 illustrates the rule: the last two digits form 1616, and 16÷4=416 \div 4 = 4 exactly, so 4∣35164 \mid 3516 — as the figure below shows.
Divisibility by 4: last 2 digits of 3516The last 2 digits of 3516 form 16, which is divisible by 4.351616divisible by 4?check the last 2 digits16 ÷ 4 = 44 | 3516
Pitfall: Testing 4 by the last digit
Judging by the last digit alone, 2,1342{,}134 looks divisible by 44 because it ends in 44, yet 34=4⋅8+234 = 4 \cdot 8 + 2, so 4∤21344 \nmid 2134. And 3,5163{,}516 ends in 66, yet 16=4⋅416 = 4 \cdot 4 gives 4∣35164 \mid 3516.

The number 7,2307{,}230: the last two digits form 3030, and 30÷4=7.530 \div 4 = 7.5. So 4∤72304 \nmid 7230.

For quick mental checks, it helps to know which two-digit endings are divisible by 44: 00,04,08,12,16,20,24,28,32,36,40,44,…00, 04, 08, 12, 16, 20, 24, 28, 32, 36, 40, 44, \ldots — every fourth number from 0000 onward.
÷1÷2÷3÷4÷5÷6÷7÷8÷9÷10÷11÷12✕0123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
The ÷4 column: every fourth number

The highlighted column marks every fourth number, and the marks depend only on the last two digits: 12, 16, 112 and 116 are all marked because 12 and 16 are multiples of 4, while the hundreds digit changes nothing. That is the rule for 4 as a column pattern. Check the last-two-digits rule against the column on the interactive divisibility table.

The rule for 8, three digits instead of two, follows the identical logic one power of ten higher.

Divisibility by 5

RULE
A number is divisible by 55 if its last digit is 00 or 55.

The logic is the same as for 22: since 1010 is divisible by 55, every digit beyond the ones place contributes a multiple of 55. Only the last digit matters, and the only single digits divisible by 55 are 00 and 55.

The number 4,8354{,}835 ends in 55, so 5∣48355 \mid 4835 — as shown below.
Divisibility by 5: last 1 digits of 4835The last 1 digits of 4835 form 5, which is divisible by 5.48355divisible by 5?check the last digitends in 55 | 4835
The number 7,8327{,}832 ends in 22, so 5∤78325 \nmid 7832.

This is the second simplest rule after divisibility by 1010 — a single-digit check with only two possible passing values.

Divisibility by 6

RULE
A number is divisible by 66 if it is divisible by both 22 and 33.

Since 6=2×36 = 2 \times 3 and gcd⁡(2,3)=1\gcd(2, 3) = 1, divisibility by 66 requires passing both individual tests: the last digit must be even, and the digit sum must be divisible by 33.

The number 1,2541{,}254: last digit 44 (even — passes the 22 test), digit sum 1+2+5+4=121 + 2 + 5 + 4 = 12 (divisible by 33 — passes the 33 test). Both conditions hold, so 6∣12546 \mid 1254.

Pitfall: Stopping after one passed test
Calling 1,2341{,}234 divisible by 66 because it is even skips the test for 33: its digit sum 1010 fails, and 1234=6⋅205+41234 = 6 \cdot 205 + 4. Both tests have to pass, as they do for 1,2541{,}254.

The number 2,1352{,}135: last digit 55 (odd — fails the 22 test). No need to check the digit sum. The number is not divisible by 66.

This approach generalizes. For any composite divisor n=a×bn = a \times b where aa and bb are coprime, divisibility by nn is equivalent to divisibility by both aa and bb.

Divisibility by 8

RULE
A number is divisible by 88 if its last three digits form a number divisible by 88.

The number 1,0001{,}000 is divisible by 88 (1000=8×1251000 = 8 \times 125), and so is every higher power of 1010. Digits beyond the hundreds place contribute multiples of 1,0001{,}000 — all divisible by 88. Only the last three digits affect the outcome.

The number 53,10453{,}104 illustrates the rule: the last three digits form 104104, and 104÷8=13104 \div 8 = 13 exactly, so 8∣531048 \mid 53104 — as the figure below shows.
Divisibility by 8: last 3 digits of 53104The last 3 digits of 53104 form 104, which is divisible by 8.53104104divisible by 8?check the last 3 digits104 ÷ 8 = 138 | 53104
The number 12,34512{,}345: the last three digits form 345345, and 345÷8=43.125345 \div 8 = 43.125. So 8∤123458 \nmid 12345.

This rule is harder to apply mentally than the rules for 22 or 55, since it requires dividing a three-digit number by 88. For quick estimates, checking whether the three-digit number is close to a known multiple of 88 (8,16,24,…,992,10008, 16, 24, \ldots, 992, 1000) can help.
Each doubling of the divisor, from 22 to 44 to 88, adds one more final digit to check.

Divisibility by 9

RULE
A number is divisible by 99 if the sum of its digits is divisible by 99.

The reasoning is identical to the rule for 33: 10≡1(mod9)10 \equiv 1 \pmod{9}, so every power of 1010 is congruent to 11 modulo 99, and each digit contributes only its face value. The number is congruent to its digit sum modulo 99.

The number 8,1278{,}127 illustrates the rule: 8+1+2+7=188 + 1 + 2 + 7 = 18, and 18÷9=218 \div 9 = 2 exactly, so 9∣81279 \mid 8127 — as shown below.
Divisibility by 9: digit sum of 8127The digits of 8127 sum to 18, which is divisible by 9.8127+++18divisible by 9?sum the digits8 + 1 + 2 + 7 = 1818 ÷ 9 = 29 | 8127
The number 4,8254{,}825: 4+8+2+5=194 + 8 + 2 + 5 = 19, and 19÷9=219 \div 9 = 2 remainder 11. So 9∤48259 \nmid 4825.

Fact: Swapped digits leave a multiple of 9
Writing 8,1728{,}172 for 8,1278{,}127 swaps two digits, and the error 45=9⋅545 = 9 \cdot 5 is a multiple of 99, as it is for every such swap: both numbers have the same digit sum. Bookkeepers whose totals differ by a multiple of 99 look first for two transposed digits.

Since 9=329 = 3^2, every number divisible by 99 is automatically divisible by 33 — but not the other way around. The number 729729 is divisible by both; the number 1212 is divisible by 33 but not by 99.

Because only the digit sum matters, the test for 99 cannot see the order of the digits. The numbers 8,1278{,}127, 8,1728{,}172 and 7,2817{,}281 all have the digit sum 1818, so all three are multiples of 99, even though they are three different numbers. The test answers the same way for every rearrangement of the same digits.

Divisibility by 10

RULE
A number is divisible by 1010 if its last digit is 00.

This is the simplest rule of all. The base of the number system is 1010, so a number has no remainder when divided by 1010 exactly when the ones place is empty.

The number 5,2305{,}230 ends in 00, so 10∣523010 \mid 5230 — as the figure below shows.
Divisibility by 10: last 1 digits of 5230The last 1 digits of 5230 form 0, which is divisible by 10.52300divisible by 10?check the last digitends in 010 | 5230
The number 5,2355{,}235 ends in 55, so 10∤523510 \nmid 5235.

Since 10=2×510 = 2 \times 5, divisibility by 1010 requires divisibility by both 22 and 55. The only digit that is simultaneously even and a multiple of 55 is 00 — which is why the rule reduces to a single condition.

Divisibility by 11

RULE
A number is divisible by 1111 if the alternating sum of its digits (from right to left: add, subtract, add, subtract, …\ldots) is divisible by 1111.

The congruence behind the rule is 10≡−1(mod11)10 \equiv -1 \pmod{11}. Successive powers of 1010 alternate: 100=110^0 = 1, 101≡−110^1 \equiv -1, 102≡110^2 \equiv 1, 103≡−110^3 \equiv -1. Each digit's contribution to the remainder alternates in sign depending on its position.

The number 9,2739{,}273 illustrates the rule: alternating sum from the right gives 3−7+2−9=−113 - 7 + 2 - 9 = -11. Since 11∣(−11)11 \mid (-11), the number is divisible by 1111 — as the figure below shows.
Divisibility by 11: alternating sum of 9273The alternating sum of 9273 from the right is -11, which is divisible by 11.9−2+7−3+← start from the right−11divisible by 11?alternating sum, right → left3 − 7 + 2 − 9 = −1111 | (−11)11 | 9273
The number 5,8315{,}831: alternating sum gives 1−3+8−5=11 - 3 + 8 - 5 = 1. Since 11∤111 \nmid 1, the number is not divisible by 1111.

If the alternating sum is negative, that is fine — a negative multiple of 1111 still indicates divisibility. The result −11-11, −22-22, or 00 all confirm the number is divisible by 1111.

Combining Rules

RULE
Divisibility by a composite number can be tested by checking its coprime factors separately.

Example
Is 2,3402{,}340 divisible by 1212? Since 12=4×312 = 4 \times 3 and gcd⁡(4,3)=1\gcd(4, 3) = 1, check each factor independently. Last two digits: 4040, and 40÷4=1040 \div 4 = 10 exactly — divisible by 44. Digit sum: 2+3+4+0=92 + 3 + 4 + 0 = 9, divisible by 33. Both conditions hold, so 12∣234012 \mid 2340.

Example
Is 8,9108{,}910 divisible by 1515? Since 15=5×315 = 5 \times 3 and gcd⁡(5,3)=1\gcd(5, 3) = 1, check both. Last digit: 00 — divisible by 55. Digit sum: 8+9+1+0=188 + 9 + 1 + 0 = 18 — divisible by 33. Both pass, so 15∣891015 \mid 8910.

The coprimality condition is essential. Testing divisibility by 1212 as "divisible by 2\text{divisible by } 2 and divisible by 6\text{divisible by } 6" is not sufficient, because gcd⁡(2,6)=2≠1\gcd(2, 6) = 2 \neq 1. The factorization must split 1212 into coprime components — 44 and 33 — for the combined test to work.
DownloadPNG2×PDF
Layout
nCoprime factorizationTests to apply
62 × 3last digit even and digit sum divisible by 3
124 × 3last two digits divisible by 4 and digit sum divisible by 3
155 × 3last digit 0 or 5 and digit sum divisible by 3
182 × 9last digit even and digit sum divisible by 9
248 × 3last three digits divisible by 8 and digit sum divisible by 3
364 × 9last two digits divisible by 4 and digit sum divisible by 9
Combining RulesLearn Math Class
Test a composite divisor through coprime factors only: factors that share a divisor can both pass while the number fails.

Worked Examples

Which of 2,3,4,5,6,8,9,102, 3, 4, 5, 6, 8, 9, 10 divide 4,3204{,}320? Last digit 00: divisible by 22, 55, and 1010. Digit sum 4+3+2+0=94 + 3 + 2 + 0 = 9: divisible by 33 and 99. Since divisible by both 22 and 33: divisible by 66. Last two digits 2020: 20÷4=520 \div 4 = 5 — divisible by 44. Last three digits 320320: 320÷8=40320 \div 8 = 40 — divisible by 88. The number passes every test.

Is 7,6237{,}623 divisible by 33? Digit sum: 7+6+2+3=187 + 6 + 2 + 3 = 18. Since 3∣183 \mid 18, yes.

Is 7,6237{,}623 divisible by 99? Same digit sum: 1818. Since 9∣189 \mid 18, yes.

Is 7,6237{,}623 divisible by 66? Last digit 33 is odd, so 2∤76232 \nmid 7623. Therefore 6∤76236 \nmid 7623, regardless of the digit sum.

Is 31,72431{,}724 divisible by 1111? Alternating sum from the right: 4−2+7−1+3=114 - 2 + 7 - 1 + 3 = 11. Since 11∣1111 \mid 11, yes.

Common error: testing divisibility by 1212 by checking 22 and 66 instead of 44 and 33. The number 1818 is divisible by both 22 and 66, but 12∤1812 \nmid 18. Coprime factorization is required.

Why These Rules Work

Every divisibility rule is a consequence of how the base 1010 behaves under modular arithmetic.

Fact: Seven has a test, but no digit pattern
On division by 77, the powers of 1010 leave remainders 1,3,2,6,4,51, 3, 2, 6, 4, 5 and then repeat, too irregular for a digit rule. Yet 77 divides 10a+b10a + b exactly when it divides a−2ba - 2b, since 10(a−2b)=(10a+b)−21b10(a - 2b) = (10a + b) - 21b: for 2,4012{,}401, 240−2=238240 - 2 = 238 and 23−16=723 - 16 = 7.

A number written in decimal is dk⋅10k+dk−1⋅10k−1+⋯+d1⋅10+d0d_k \cdot 10^k + d_{k-1} \cdot 10^{k-1} + \cdots + d_1 \cdot 10 + d_0. Reducing this expression modulo a divisor nn replaces each 10j10^j with its remainder modulo nn, and the pattern of those remainders determines the rule. The symbol ≡\equiv below reads "is congruent to" — the notation is introduced in the congruence section of the modulo page.

For n=2n = 2 or n=5n = 5: 10≡010 \equiv 0, so all terms except d0d_0 vanish. Only the last digit matters.

For n=4n = 4: 100≡0(mod4)100 \equiv 0 \pmod{4}, so all terms beyond d1⋅10+d0d_1 \cdot 10 + d_0 vanish. The last two digits determine divisibility.

For n=8n = 8: 1000≡0(mod8)1000 \equiv 0 \pmod{8}, extending the same logic to the last three digits.

For n=3n = 3 or n=9n = 9: 10≡110 \equiv 1, so 10k≡110^k \equiv 1 for all kk. Every digit contributes its face value and nothing more. The number reduces to its digit sum.

For n=11n = 11: 10≡−110 \equiv -1, so 10k10^k alternates between 11 and −1-1. Digits contribute with alternating signs, producing the alternating-sum rule.

Each rule is a human-readable compression of a modular identity. The modular arithmetic page develops these identities in full.
DownloadPNG2×PDF
Layout
Key modular factResulting mechanismRules covered
10 ≡ 0 (mod 2), (mod 5), (mod 10)all digits except the last vanish — only the ones digit mattersrules for 2, 5, 10
10² ≡ 0 (mod 4)all digits beyond the tens place vanish — only the last two matterrule for 4
10³ ≡ 0 (mod 8)all digits beyond the hundreds place vanish — only the last three matterrule for 8
10 ≡ 1 (mod 3), (mod 9)every power of 10 is ≡ 1 — every digit contributes its face value → digit sumrules for 3, 9
10 ≡ −1 (mod 11)powers of 10 alternate +1, −1, +1, … — digits contribute with alternating signsrule for 11
Why These Rules WorkLearn Math Class

Summary: Master Rules Reference

Every rule introduced on this page has the same shape — read off a small slice of the number's digits, do a short calculation, check divisibility of the result. The table below collects all nine rules side by side, paired with a worked example and the modular identity that makes the rule work. It's designed as the page you'd bookmark and return to: one row per divisor, all the information for applying and understanding each rule in a single line.
DownloadPNG2×PDF
Layout
DivisorTestWorked exampleModular reason
2last digit is 0, 2, 4, 6, or 81746 → ends in 6 (even) ✓10 ≡ 0 (mod 2)
3digit sum is divisible by 3729 → 7+2+9=18 → 18 ÷ 3 = 6 ✓10 ≡ 1 (mod 3)
4last two digits form a number divisible by 43516 → 16, and 16 ÷ 4 = 4 ✓10² ≡ 0 (mod 4)
5last digit is 0 or 54835 → ends in 5 ✓10 ≡ 0 (mod 5)
6passes the test for 2 AND the test for 31254 → 4 (even) ✓ and 1+2+5+4=12, 12 ÷ 3 = 4 ✓6 = 2 · 3 with gcd(2, 3) = 1
8last three digits form a number divisible by 853104 → 104, and 104 ÷ 8 = 13 ✓10³ ≡ 0 (mod 8)
9digit sum is divisible by 98127 → 8+1+2+7=18, and 18 ÷ 9 = 2 ✓10 ≡ 1 (mod 9)
10last digit is 05230 → ends in 0 ✓10 ≡ 0 (mod 10)
11alternating sum of digits (right → left) is divisible by 119273 → 3 − 7 + 2 − 9 = −11, and 11 ∣ (−11) ✓10 ≡ −1 (mod 11)
Summary: Master Rules ReferenceLearn Math Class

Common Pitfalls

Four mistakes account for many of the wrong answers when the rules are applied. The first three are marked where they happen in the sections above, and the fourth is the one the Combining Rules section warns about; here each is worked through in full, with the wrong and the right working side by side.
DownloadPNG2×PDF
1Testing 3 by the last digit
The last-digit tests for 22, 55 and 1010 are carried over to 33, and a number is judged by whether its last digit is a multiple of 33.
Wrong turn
Error here
2,1432{,}143 ends in 33, so 3∣21433 \mid 2143; 1,2571{,}257 ends in 77, so 3∤12573 \nmid 1257.
Right path
The digit sum decides. 2+1+4+3=102 + 1 + 4 + 3 = 10 is not a multiple of 33, so 3∤21433 \nmid 2143, and indeed 2143=3⋅714+12143 = 3 \cdot 714 + 1. 1+2+5+7=151 + 2 + 5 + 7 = 15 is a multiple of 33, so 3∣12573 \mid 1257, and indeed 1257=3⋅4191257 = 3 \cdot 419.
Why it happensThe last-digit rules are learned first and are the simplest, so the same kind of rule is expected for every divisor. They work only for divisors of 1010, and 33 does not divide 1010: since 10≡1(mod3)10 \equiv 1 \pmod{3}, every digit counts, not just the last one.
How to checkDivide once. 2143÷32143 \div 3 is 714714 with remainder 11, while 1257÷3=4191257 \div 3 = 419 exactly.
2Testing 4 by the last digit
The rule for 44 is shortened to look like the rule for 22: a number is judged by whether its last digit alone is a multiple of 44.
Wrong turn
Error here
2,1342{,}134 ends in 44, so 4∣21344 \mid 2134; 3,5163{,}516 ends in 66, so 4∤35164 \nmid 3516.
Right path
The last two digits decide. 34=4⋅8+234 = 4 \cdot 8 + 2, so 4∤21344 \nmid 2134. 16=4⋅416 = 4 \cdot 4, so 4∣35164 \mid 3516, and indeed 3516=4⋅8793516 = 4 \cdot 879.
Why it happens44 is even, so a one-digit test like the one for 22 seems natural. But 1010 is not a multiple of 44, so the tens digit still changes the remainder; only 100100 is a multiple of 44. The endings 1414 and 3434 end in 44 and are not multiples of 44, while 1616 and 3636 end in 66 and are.
How to checkWith an even tens digit the last digit must be 00, 44 or 88; with an odd tens digit it must be 22 or 66. In 2,1342{,}134 the tens digit 33 is odd and the last digit is 44, so 4∤21344 \nmid 2134.
3Stopping after one passed test
Divisibility by 66 needs two tests, and the number is declared divisible after passing only one of them, usually the test for 22.
Wrong turn
Error here
1,2341{,}234 ends in 44, so it is even, and therefore 6∣12346 \mid 1234.
Right path
The test for 33 has to pass as well. 1+2+3+4=101 + 2 + 3 + 4 = 10 is not a multiple of 33, so 3∤12343 \nmid 1234 and 6∤12346 \nmid 1234. Indeed 1234=6⋅205+41234 = 6 \cdot 205 + 4.
Why it happensA failed test settles the question at once, as for 2,1352{,}135, where the odd last digit is enough. That shortcut is carried over to a passed test, which settles nothing on its own.
How to checkEvery multiple of 66 is also a multiple of 33. Since 1234=3⋅411+11234 = 3 \cdot 411 + 1, it cannot be a multiple of 66.
4Combining factors that are not coprime
A composite divisor is split into two factors that share a divisor, as when 1212 is tested through 22 and 66, and passing both tests is taken as proof.
Wrong turn
Error here
1818 is even and 18=6⋅318 = 6 \cdot 3, so it passes the tests for 22 and for 66, and therefore 12∣1812 \mid 18.
Right path
Split 1212 into coprime factors, 12=4⋅312 = 4 \cdot 3 with gcd⁡(4,3)=1\gcd(4, 3) = 1. The last two digits 18=4⋅4+218 = 4 \cdot 4 + 2 fail the test for 44, so 12∤1812 \nmid 18. Indeed 18=12⋅1+618 = 12 \cdot 1 + 6.
Why it happens2⋅6=122 \cdot 6 = 12, so the split looks natural. But every multiple of 66 is already even, so the test for 22 adds nothing, and the two tests together only show divisibility by lcm(2,6)=6\text{lcm}(2, 6) = 6.
How to checkCompute the GCD of the two factors before using them. gcd⁡(2,6)=2\gcd(2, 6) = 2 rules the split out; the table in the Combining Rules section lists coprime splits such as 12=4⋅312 = 4 \cdot 3 and 24=8⋅324 = 8 \cdot 3.
Common pitfalls with the divisibility rules·/arithmetic/divisibility/rulesLearn Math Class
Each slip applies a rule to the wrong digits or stops too soon. Divisibility by 33 depends on the digit sum and divisibility by 44 on the last two digits, a test for 66 needs both the test for 22 and the test for 33, and two tests combine only when their divisors are coprime, as in 12=4⋅312 = 4 \cdot 3. A single division settles each case.

Skills You Should Learn

Each skill opens its step-by-step method page.
Arithmetic methods
  • Test divisibility by 3Single ruleYou want to know whether 33 divides a number without dividing it: 729729, 1,2341{,}234, 5,8325{,}832.
  • Test divisibility by 6Single ruleYou need to know whether 66 divides a number: 1,2541{,}254, 1,2341{,}234, 4,5124{,}512. Since 6=2⋅36 = 2 \cdot 3 with gcd⁡(2,3)=1\gcd(2, 3) = 1, two quick tests decide it.
  • Test divisibility by 9Single ruleYou want to know whether 99 divides a number: 8,1278{,}127, 4,8254{,}825, 6,4716{,}471. The digit sum also gives the remainder after division by 99.
  • Test divisibility by 11Single ruleYou want to know whether 1111 divides a number, for example while factoring: 9,2739{,}273, 5,8315{,}831, 143143.
  • Test divisibility by 2Single ruleYou need to know whether a whole number is even, for example before halving it or factoring out a 22: 1,7461{,}746, 3,8213{,}821, 90,31890{,}318.
  • Test divisibility by 4Single ruleYou need to know whether 44 divides a number with three or more digits: 3,5163{,}516, 7,2307{,}230, 2,1342{,}134.
  • Test divisibility by 5Single ruleYou want to know whether 55 divides a number, for example while factoring or simplifying a fraction: 4,8354{,}835, 7,8327{,}832, 990990.
  • Test divisibility by 10Single ruleYou need to know whether 1010 divides a number, or whether both 22 and 55 do: 5,2305{,}230, 5,2355{,}235, 7,2507{,}250.

Divisibility Rules FAQ

How do you test divisibility by 12?

+
Test divisibility by 4 AND by 3 (coprime factors of 12). Check that the last two digits are divisible by 4 AND the digit sum is divisible by 3. For 1,236: 36 ÷ 4 = 9 and 1+2+3+6 = 12, so 12 | 1236. Do NOT test 2 and 6 — they are not coprime (gcd(2,6)=2≠1). Check any candidate with the divisibility calculator.Read more →

Why does the digit sum rule work for 3 and 9?

+
Because 10 ≡ 1 (mod 3) and 10 ≡ 1 (mod 9). Every power of 10 is congruent to 1, so a digit d in position k contributes d×10^k ≡ d×1 = d. The number reduces to the sum of its digits under these moduli.Read more →

Why does the alternating sum rule work for 11?

+
Because 10 ≡ -1 (mod 11): powers of 10 alternate, 10⁰ = 1, 10¹ ≡ -1, 10² ≡ 1, 10³ ≡ -1. Each digit's contribution therefore alternates in sign with its position, producing the alternating-sum pattern. For 9,273: from the right, 3 − 7 + 2 − 9 = −11, and 11 divides −11, so 11 | 9273.Read more →

Is there a divisibility rule for 7?

+
Yes, though not a digit pattern like the rules for 33 or 1111. Write the number as 10a+b10a + b, with bb its last digit, and compute a−2ba - 2b: since 10(a−2b)=(10a+b)−21b10(a - 2b) = (10a + b) - 21b and 77 shares no factor with 1010, 77 divides the number exactly when it divides a−2ba - 2b. Repeat until the number is small: for 2,4012{,}401, 240−2=238240 - 2 = 238, then 23−16=723 - 16 = 7, so 7∣24017 \mid 2401.Read more →

Why is the error from swapped digits divisible by 9?

+
Because swapping two digits leaves the digit sum unchanged, and a number and its digit sum leave the same remainder on division by 99. The correct and the swapped number therefore leave the same remainder, so their difference is a multiple of 99: writing 8,1728{,}172 for 8,1278{,}127 makes an error of 45=9⋅545 = 9 \cdot 5. That is why bookkeepers whose totals are off by a multiple of 99 look first for two transposed digits.Read more →