How do you test divisibility by 2?

A number is divisible by 2 if its last digit is even (0, 2, 4, 6, or 8). Since 10 is divisible by 2, all digits except the last contribute multiples of 2, so only the ones digit matters.

How do you test divisibility by 3?

A number is divisible by 3 if the sum of its digits is divisible by 3. This works because 10 ≡ 1 (mod 3), so each digit contributes only its face value. For 729: 7+2+9=18, and 3|18, so 3|729.

How do you test divisibility by 4?

A number is divisible by 4 if its last two digits form a number divisible by 4. Since 100 is divisible by 4, only the tens and ones places affect the remainder. For 3,516: 16÷4=4 exactly, so 4|3516.

How do you test divisibility by 5?

A number is divisible by 5 if its last digit is 0 or 5. Like divisibility by 2, since 10 is divisible by 5, only the last digit matters, and only 0 and 5 are single digits divisible by 5.

How do you test divisibility by 6?

A number is divisible by 6 if it is divisible by both 2 AND 3. Since 6=2×3 and gcd(2,3)=1, check that the last digit is even AND the digit sum is divisible by 3. Both conditions must hold.

How do you test divisibility by 8?

A number is divisible by 8 if its last three digits form a number divisible by 8. Since 1000 is divisible by 8, only the last three digits affect the remainder. For 53,104: 104÷8=13, so 8|53104.

How do you test divisibility by 9?

A number is divisible by 9 if the sum of its digits is divisible by 9. The reasoning is identical to divisibility by 3: since 10≡1 (mod 9), each digit contributes its face value. For 8,127: 8+1+2+7=18, and 9|18.

How do you test divisibility by 10?

A number is divisible by 10 if its last digit is 0. This is the simplest rule — the base of our number system is 10, so a number has no remainder when the ones place is empty.

How do you test divisibility by 11?

A number is divisible by 11 if the alternating sum of its digits (from right: add, subtract, add...) is divisible by 11. This works because 10≡-1 (mod 11), so digit positions alternate in sign. For 9,273: 3-7+2-9=-11, and 11|-11.

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. Do NOT test 2 and 6 — they are not coprime (gcd(2,6)=2≠1).

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.

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 alternates in sign based on position, producing the alternating-sum pattern.

Divisibility Rules

Q: What are divisibility rules?

Divisibility rules are shortcuts that determine whether a number is divisible by a given divisor without performing the full division. They exploit patterns in decimal digits based on how powers of 10 behave under modular arithmetic.

Key Terms

What Are Divisibility Rules?

Summary: Master Rules Reference

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-

10

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?

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 \div 3

and checking for a remainder, the rule says: add the digits

7 + 8 + 3 + 6 = 24

, and check whether that sum is divisible by

3

. It is, so

3 \mid 7836

.

Every rule exploits the structure of base-

10

representation. A number like

5{,}432

is shorthand for

5 \cdot 10^3 + 4 \cdot 10^2 + 3 \cdot 10 + 2

. The behavior of the powers of

10

under modulo determines which digit patterns reveal divisibility — and different divisors respond to different patterns.

The rules are shortcuts, not definitions. The definition of divisibility is

a \mid b

when

b = a \cdot k

for some integer — equivalently, when

b \bmod a = 0

. The rules provide fast paths to that same conclusion.

Divisibility by 2

A number is divisible by

2

if its last digit is even:

0, 2, 4, 6

, or

8

.

Since

10

is divisible by

2

, every power of

10

is also divisible by

2

. The contribution of each digit beyond the ones place —

d \cdot 10^k

for

k \geq 1

— is automatically a multiple of

2

. Only the final digit

d_0

remains outside that guarantee, so

d_0

alone determines divisibility.

The number

1{,}746

ends in

6

(even), so

2 \mid 1746

.

The number

3{,}821

ends in

1

(odd), so

2 \nmid 3821

.

The even numbers —

\ldots, -4, -2, 0, 2, 4, 6, \ldots

— are precisely the integers divisible by

2

. The odd numbers are those that leave a remainder of

1

Divisibility by 3

A number is divisible by

3

if the sum of its digits is divisible by

3

.

The reason traces to a single congruence:

10 \equiv 1 \pmod{3}

. Every power of

10

is also congruent to

1

modulo

3

10^2 \equiv 1

10^3 \equiv 1

, and so on. A digit

d

in the

k

th place contributes

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

3

.

The number

729

7 + 2 + 9 = 18

, and

1 + 8 = 9

. Since

3 \mid 9

, the number is divisible by

3

.

The number

1{,}234

1 + 2 + 3 + 4 = 10

, and

1 + 0 = 1

. Since

3 \nmid 1

, the number is not divisible by

3

.

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.

Divisibility by 4

A number is divisible by

4

if its last two digits form a number divisible by

4

.

The number

100

is divisible by

4

, and so is every higher power of

10

. Every digit beyond the tens place contributes a multiple of

100

— automatically a multiple of

4

. Only the last two digits affect the remainder when dividing by

4

.

The number

3{,}516

: the last two digits form

16

, and

16 \div 4 = 4

exactly. So

4 \mid 3516

.

The number

7{,}230

: the last two digits form

30

, and

30 \div 4 = 7.5

. So

4 \nmid 7230

.

For quick mental checks, it helps to know which two-digit endings are divisible by

4

00, 04, 08, 12, 16, 20, 24, 28, 32, 36, 40, 44, \ldots

— every fourth number from

00

onward.

Divisibility by 5

A number is divisible by

5

if its last digit is

0

5

.

The logic is the same as for

2

: since

10

is divisible by

5

, every digit beyond the ones place contributes a multiple of

5

. Only the last digit matters, and the only single digits divisible by

5

are

0

and

5

.

The number

4{,}835

ends in

5

, so

5 \mid 4835

.

The number

7{,}832

ends in

2

, so

5 \nmid 7832

.

This is the second simplest rule after divisibility by

10

— a single-digit check with only two possible passing values.

Divisibility by 6

A number is divisible by

6

if it is divisible by both

2

and

3

.

Since

6 = 2 \times 3

and

\gcd(2, 3) = 1

, divisibility by

6

requires passing both individual tests: the last digit must be even, and the digit sum must be divisible by

3

.

The number

1{,}254

: last digit

4

(even — passes the

2

test), digit sum

1 + 2 + 5 + 4 = 12

(divisible by

3

— passes the

3

test). Both conditions hold, so

6 \mid 1254

.

The number

2{,}135

: last digit

5

(odd — fails the

2

test). No need to check the digit sum. The number is not divisible by

6

.

This approach generalizes. For any composite divisor

n = a \times b

where

a

and

b

are coprime, divisibility by

n

is equivalent to divisibility by both

a

and

b

Divisibility by 8

A number is divisible by

8

if its last three digits form a number divisible by

8

.

The number

1{,}000

is divisible by

8

(

1000 = 8 \times 125

), and so is every higher power of

10

. Digits beyond the hundreds place contribute multiples of

1{,}000

— all divisible by

8

. Only the last three digits affect the outcome.

The number

53{,}104

: the last three digits form

104

, and

104 \div 8 = 13

exactly. So

8 \mid 53104

.

The number

12{,}345

: the last three digits form

345

, and

345 \div 8 = 43.125

. So

8 \nmid 12345

.

This rule is harder to apply mentally than the rules for

2

5

, since it requires dividing a three-digit number by

8

. For quick estimates, checking whether the three-digit number is close to a known multiple of

8

(

8, 16, 24, \ldots, 992, 1000

) can help.

Divisibility by 9

A number is divisible by

9

if the sum of its digits is divisible by

9

.

The reasoning is identical to the rule for

3

10 \equiv 1 \pmod{9}

, so every power of

10

is congruent to

1

modulo

9

, and each digit contributes only its face value. The number is congruent to its digit sum modulo

9

.

The number

8{,}127

8 + 1 + 2 + 7 = 18

, and

18 \div 9 = 2

exactly. So

9 \mid 8127

.

The number

4{,}825

4 + 8 + 2 + 5 = 19

, and

19 \div 9 = 2

remainder

1

. So

9 \nmid 4825

.

Since

9 = 3^2

, every number divisible by

9

is automatically divisible by

3

— but not the other way around. The number

729

is divisible by both; the number

12

is divisible by

3

but not by

9

Divisibility by 10

A number is divisible by

10

if its last digit is

0

.

This is the simplest rule of all. The base of the number system is

10

, so a number has no remainder when divided by

10

exactly when the ones place is empty.

The number

5{,}230

ends in

0

, so

10 \mid 5230

.

The number

5{,}235

ends in

5

, so

10 \nmid 5235

.

Since

10 = 2 \times 5

, divisibility by

10

requires divisibility by both

2

and

5

. The only digit that is simultaneously even and a multiple of

5

0

— which is why the rule reduces to a single condition.

Divisibility by 11

A number is divisible by

11

if the alternating sum of its digits (from right to left: add, subtract, add, subtract,

\ldots

) is divisible by

11

.

The congruence behind the rule is

10 \equiv -1 \pmod{11}

. Successive powers of

10

alternate:

10^0 = 1

10^1 \equiv -1

10^2 \equiv 1

10^3 \equiv -1

. Each digit's contribution to the remainder alternates in sign depending on its position.

The number

9{,}273

: alternating sum from the right gives

3 - 7 + 2 - 9 = -11

. Since

11 \mid (-11)

, the number is divisible by

11

.

The number

5{,}831

: alternating sum gives

1 - 3 + 8 - 5 = 1

. Since

11 \nmid 1

, the number is not divisible by

11

.

If the alternating sum is negative, that is fine — a negative multiple of

11

still indicates divisibility. The result

-11

-22

, or

0

all confirm the number is divisible by

11

Combining Rules

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

Is

2{,}340

divisible by

12

? Since

12 = 4 \times 3

and

\gcd(4, 3) = 1

, check each factor independently. Last two digits:

40

, and

40 \div 4 = 10

exactly — divisible by

4

. Digit sum:

2 + 3 + 4 + 0 = 9

, divisible by

3

. Both conditions hold, so

12 \mid 2340

.

Is

8{,}910

divisible by

15

? Since

15 = 5 \times 3

and

\gcd(5, 3) = 1

, check both. Last digit:

0

— divisible by

5

. Digit sum:

8 + 9 + 1 + 0 = 18

— divisible by

3

. Both pass, so

15 \mid 8910

.

The coprimality condition is essential. Testing divisibility by

12

as "

\text{divisible by } 2

and

\text{divisible by } 6

" is not sufficient, because

\gcd(2, 6) = 2 \neq 1

. The factorization must split

12

into coprime components —

4

and

3

— for the combined test to work.

n	Coprime factorization	Tests to apply
6	2 × 3	last digit even and digit sum divisible by 3
12	4 × 3	last two digits divisible by 4 and digit sum divisible by 3
15	5 × 3	last digit 0 or 5 and digit sum divisible by 3
18	2 × 9	last digit even and digit sum divisible by 9
24	8 × 3	last three digits divisible by 8 and digit sum divisible by 3
36	4 × 9	last two digits divisible by 4 and digit sum divisible by 9

Test divisibility by any of these rules with our Divisibility Calculator →

Worked Examples

Which of

2, 3, 4, 5, 6, 8, 9, 10

divide

4{,}320

? Last digit

0

: divisible by

2

5

, and

10

. Digit sum

4 + 3 + 2 + 0 = 9

: divisible by

3

and

9

. Since divisible by both

2

and

3

: divisible by

6

. Last two digits

20

20 \div 4 = 5

— divisible by

4

. Last three digits

320

320 \div 8 = 40

— divisible by

8

. The number passes every test.

Is

7{,}623

divisible by

3

? Digit sum:

7 + 6 + 2 + 3 = 18

. Since

3 \mid 18

, yes.

Is

7{,}623

divisible by

9

? Same digit sum:

18

. Since

9 \mid 18

, yes.

Is

7{,}623

divisible by

6

? Last digit

3

is odd, so

2 \nmid 7623

. Therefore

6 \nmid 7623

, regardless of the digit sum.

Is

31{,}724

divisible by

11

? Alternating sum from the right:

4 - 2 + 7 - 1 + 3 = 11

. Since

11 \mid 11

, yes.

Common error: testing divisibility by

12

by checking

2

and

6

instead of

4

and

3

. The number

18

is divisible by both

2

and

6

, but

12 \nmid 18

. Coprime factorization is required.

Why These Rules Work

Every divisibility rule is a consequence of how the base

10

behaves under modular arithmetic.

A number written in decimal is

d_k \cdot 10^k + d_{k-1} \cdot 10^{k-1} + \cdots + d_1 \cdot 10 + d_0

. Reducing this expression modulo a divisor

n

replaces each

10^j

with its remainder modulo

n

, and the pattern of those remainders determines the rule.

For

n = 2

n = 5

10 \equiv 0

, so all terms except

d_0

vanish. Only the last digit matters.

For

n = 4

100 \equiv 0 \pmod{4}

, so all terms beyond

d_1 \cdot 10 + d_0

vanish. The last two digits determine divisibility.

For

n = 8

1000 \equiv 0 \pmod{8}

, extending the same logic to the last three digits.

For

n = 3

n = 9

10 \equiv 1

, so

10^k \equiv 1

for all

k

. Every digit contributes its face value and nothing more. The number reduces to its digit sum.

For

n = 11

10 \equiv -1

, so

10^k

alternates between

1

and

-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.

Key modular fact	Resulting mechanism	Rules covered
10 ≡ 0 (mod 2), (mod 5), (mod 10)	all digits except the last vanish — only the ones digit matters	rules for 2, 5, 10
10² ≡ 0 (mod 4)	all digits beyond the tens place vanish — only the last two matter	rule for 4
10³ ≡ 0 (mod 8)	all digits beyond the hundreds place vanish — only the last three matter	rule for 8
10 ≡ 1 (mod 3), (mod 9)	every power of 10 is ≡ 1 — every digit contributes its face value → digit sum	rules for 3, 9
10 ≡ −1 (mod 11)	powers of 10 alternate +1, −1, +1, … — digits contribute with alternating signs	rule for 11

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.

Divisor	Test	Worked example	Modular reason
2	last digit is 0, 2, 4, 6, or 8	1746 → ends in 6 (even) ✓	10 ≡ 0 (mod 2)
3	digit sum is divisible by 3	729 → 7+2+9=18 → 18 ÷ 3 = 6 ✓	10 ≡ 1 (mod 3)
4	last two digits form a number divisible by 4	3516 → 16, and 16 ÷ 4 = 4 ✓	10² ≡ 0 (mod 4)
5	last digit is 0 or 5	4835 → ends in 5 ✓	10 ≡ 0 (mod 5)
6	passes the test for 2 AND the test for 3	1254 → 4 (even) ✓ and 1+2+5+4=12, 12 ÷ 3 = 4 ✓	6 = 2 · 3 with gcd(2, 3) = 1
8	last three digits form a number divisible by 8	53104 → 104, and 104 ÷ 8 = 13 ✓	10³ ≡ 0 (mod 8)
9	digit sum is divisible by 9	8127 → 8+1+2+7=18, and 18 ÷ 9 = 2 ✓	10 ≡ 1 (mod 9)
10	last digit is 0	5230 → ends in 0 ✓	10 ≡ 0 (mod 10)
11	alternating sum of digits (right → left) is divisible by 11	9273 → 3 − 7 + 2 − 9 = −11, and 11 ∣ (−11) ✓	10 ≡ −1 (mod 11)