Diviso

Divisibility condition

No special condition. Any

integer is divisible by 1.

The last digit is even (0, 2, 4, 6,

or 8).[1][2]

Examples

2 is divisible by 1.

1,294: 4 is even.

405 4 + 0 + 5 = 9 and 636 6 + 3 + 6 = 15

Sum the digits. If the result is
divisible by 3, then the original
number is divisible by 3.[1][3][4]

which both are clearly divisible by 3.

16,499,205,854,376
1+6+4+9+9+2+0+5+8+5+4+3+7+6 sums to 69
6 + 9 = 15 1 + 5 = 6, which is clearly divisible
by 3.

Subtract the quantity of the

digits 2, 5, and 8 in the number
from the quantity of the digits 1,
4, and 7 in the number.

Using the example above: 16,499,205,854,376

has four of the digits 1, 4 and 7 and four of the
digits 2, 5 and 8; Since 4 4 = 0 is a multiple of
3, the number 16,499,205,854,376 is divisible by
3.

Examine the last two digits.[1][2]

40832: 32 is divisible by 4.

If the tens digit is even, the ones

40832: 3 is odd, and the last digit is 2.

digit must be 0, 4, or 8.
If the tens digit is odd, the ones
digit must be 2 or 6.

Twice the tens digit, plus the

ones digit.

The last digit is 0 or 5.[1][2]

40832: 2 3 + 2 = 8, which is divisible by 4.

495: the last digit is 5.

1,458: 1 + 4 + 5 + 8 = 18, so it is divisible by 3

6

It is divisible by 2 and by 3.[5]

and the last digit is even, hence the number is

divisible by 6.

Form the alternating sum of

blocks of three from right to left. 1,369,851: 851 369 + 1 = 483 = 7 69
[4][6]

Subtract 2 times the last digit

from the rest. (Works because 21 483: 48 (3 2) = 42 = 7 6.
is divisible by 7.)

Or, add 5 times the last digit to

the rest. (Works because 49 is

483: 48 + (3 5) = 63 = 7 9.

divisible by 7.)

Or, add 3 times the first digit to

the next. (This works because
10a + b 7a = 3a + b last

483: 43 + 8 = 20 remainder 6, 63 + 3 = 21.

number has the same remainder)

Multiply each digit (from right

483595: (4 (-2)) + (8 (-3)) + (3 (-1)) + (5

to left) by the digit in the

2) + (9 3) + (5 1) = 7.

corresponding position in this

pattern (from left to right): 1, 3,
2, -1, -3, -2 (repeating for digits
beyond the hundred-thousands
place). Then sum the results.

If the hundreds digit is even,

examine the number formed by

624: 24.

the last two digits.

If the hundreds digit is odd,

examine the number obtained by 352: 52 + 4 = 56.
the last two digits plus 4.
8

Add the last digit to twice the

rest.

Examine the last three digits.[1][2]

56: (5 2) + 6 = 16.

34152: Examine divisibility of just 152: 19 8

Add four times the hundreds

digit to twice the tens digit to the 34152: 4 1 + 5 2 + 2 = 16
ones digit.

Sum the digits. If the result is

9

divisible by 9, then the original

2,880: 2 + 8 + 8 + 0 = 18: 1 + 8 = 9.

number is divisible by 9.[1][3][4]

10

The last digit is 0.[2]

130: the last digit is 0.

Form the alternating sum of the

digits.[1][4]

Add the digits in blocks of two

from right to left.[1]

Subtract the last digit from the

rest.

11

918,082: 9 1 + 8 0 + 8 2 = 22.

627: 6 + 27 = 33.

627: 62 7 = 55.

Add the last digit to the

hundredth place (add 10 times

627: 62 + 70 = 132.

the last digit to the rest).

If the number of digits is even,

add the first and subtract the last
digit from the rest.

If the number of digits is odd,

subtract the first and last digit
from the rest.

It is divisible by 3 and by 4.[5]

918,082: the number of digits is even (6) 1808

+ 9 2 = 1815: 81 + 1 5 = 77 = 7 11

14,179: the number of digits is odd (5) 417 1

9 = 407 = 37 11

324: it is divisible by 3 and by 4.

12
Subtract the last digit from twice
the rest.

13

Form the alternating sum of

blocks of three from right to left.

324: 32 2 4 = 60.

2,911,272: 2 + 911 272 = 637

[6]

Add 4 times the last digit to the

rest.

Subtract 9 times the last digit

from the rest.

It is divisible by 2 and by 7.[5]

14

Add the last two digits to twice

the rest. The answer must be
divisible by 14.

15

It is divisible by 3 and by 5.[5]

637: 63 + 7 4 = 91, 9 + 1 4 = 13.

637: 63 - 63 = 0.

224: it is divisible by 2 and by 7.

364: 3 2 + 64 = 70.
1764: 17 2 + 64 = 98.

390: it is divisible by 3 and by 5.

If the thousands digit is even,

examine the number formed by

254,176: 176.

the last three digits.

If the thousands digit is odd,

16

examine the number formed by

3,408: 408 + 8 = 416.

the last three digits plus 8.

Add the last two digits to four

times the rest.
Examine the last four digits.[1][2]

176: 1 4 + 76 = 80.
1168: 11 4 + 68 = 112.
157,648: 7,648 = 478 16.

Subtract 5 times the last digit

17

from the rest.

It is divisible by 2 and by 9.[5]

18

Add twice the last digit to the

19

rest.
It is divisible by 10, and the tens
digit is even.

20

If the number formed by the last

two digits is divisible by 20.

221: 22 1 5 = 17.
342: it is divisible by 2 and by 9.
437: 43 + 7 2 = 57.

360: is divisible by 10, and 6 is even.

480: 80 is divisible by 20.

The following table provides rules for a few more notable divisors:
Diviso
r

Divisibility condition

Examples

168: 16 (82) = 0, 168 is

Subtract twice the last digit from the rest.

divisible.
1050: 105 (02) = 105, 10
(52) = 0, 1050 is divisible.

21
105: 1 + 0 + 5 = 6, 10 + (55) =
Sum of the digits are divisible by 3 and the

35 = 7 5, 105 is divisible.

number is divisible by 7

210: 2 + 1 + 0 = 3, 21 + (05) =
21 = 7 3, 210 is divisible

23

Add 7 times the last digit to the rest.

3128: 312 + (87) = 368, 368

23 = 16.

25

The number formed by the last two digits is

divisible by 25.[2]

Sum the digits in blocks of three from right to left.

If the result is divisible by 27, then the number is
27

divisible by 27.

134,250: 50 is divisible by 25.

2,644,272: 2 + 644 + 272 = 918

= 2734.

Subtract 8 times the last digit from the rest.

621: 62 (18) = 54.

29

Add three times the last digit to the rest.

261: 13 = 3; 3 + 26 = 29

31

Subtract three times the last digit from the rest.

837: 83 37 = 62

The number formed by the last five digits is

divisible by 32.[1][2]

If the ten thousands digit is even, examine the

number formed by the last four digits.

25,135,520: 35,520=111032

41,312: 1312.

32
If the ten thousands digit is odd, examine the
number formed by the last four digits plus 16.

33

254,176: 4176+16 = 4192.

Add the last two digits to 4 times the rest.

1,312: (134) + 12 = 64.

Add 10 times the last digit to the rest; it has to be

627: 62 + 7 10 = 132,

divisible by 3 and 11.

13 + 2 10 = 33.

Add the digits in blocks of two from right to left.

35

Number must be divisible by 7 ending in 0 or 5.

2,145: 21 + 45 = 66.

700 is divisible by 7 ending in a

0.

Take the digits in blocks of three from right to left

2,651,272: 2 + 651 + 272 = 925.

and add each block, just as for 27.

925 = 3725.

Subtract 11 times the last digit from the rest.

925: 92 (511) = 37.

39

Add 4 times the last digit to the rest.

351: 1 4 = 4; 4 + 35 = 39

41

Subtract 4 times the last digit from the rest.

738: 73 8 4 = 41.

37

36,249: 3624 + 9 13 = 3741,

Add 13 times the last digit to the rest.

Subtract 30 times the last digit from the rest.

47

38 + 7 13 = 129,
12 + 9 13 = 129 = 43 3.

43

45

374 + 1 13 = 387,

The number must be divisible by 9 ending in 0 or

5.[5]

Subtract 14 times the last digit from the rest.

36,249: 3624 - 9 30 = 3354,

335 - 4 30 = 215 = 43 5.

495: 4 + 9 + 5 = 18, 1 + 8 = 9;
(495 is divisible by both 5 and
9.)

1,642,979: 164297 9 14 =

164171,
16417 14 = 16403,
1640 3 14 = 1598,
159 8 14 = 47.

1,127: 112+(75)=147.

49

Add 5 times the last digit to the rest.

50

The last two digits are 00 or 50.

134,250: 50.

51

Subtract 5 times the last digit to the rest.

204: 20-(45)=0

53

Add 16 times the last digit to the rest.

3657: 365+(716)=477 = 9 53

55

Number must be divisible by 11 ending in 0 or 5.[5] 935: 93 5 = 88 or 9 + 35 = 44.

59

Add 6 times the last digit to the rest.

295: 56 = 30; 30 + 29 = 59

61

Subtract 6 times the last digit from the rest.

732: 73-(26)=61

64

65

66

The number formed by the last six digits must be

divisible by 64.[1][2]

147: 14 + (75) = 49

2,640,000 is divisible by 64.

Number must be divisible by 13 ending in 0 or 5.

130 is divisible by 13 ending in

[5]

0.

Number must be divisible by 6 and 11.[5]

132 is divisible by 6 and 11.

67

Subtract twice the last two digits from the rest.

9112: 212 = 24; 91 - 24 = 67

69

Add 7 times the last digit to the rest.

345: 57 = 35; 35 + 34 = 69

71

Subtract 7 times the last digit from the rest.

852: 85-(27)=71

Number must be divisible by 3 ending in 00, 25,

825: ends in 25 and is divisible

75

77

50 or 75.

[5]

Form the alternating sum of blocks of three from

right to left.

by 3.

76,923: 923 - 76 = 847.

79

Add 8 times the last digit to the rest.

711: 18 = 8; 8 + 71 = 79

81

Subtract 8 times the last digit from the rest.

162: 16-(28)=0

83

Add 25 times the last digit from the rest.

581: 58+(125)=83

89

Add 9 times the last digit to the rest.

801: 19 = 9; 80 + 9 = 89

Subtract 9 times the last digit from the rest.

182: 18-(29)=0

91
Form the alternating sum of blocks of three from
right to left.

5,274,997: 5 - 274 + 997 = 728

99

Add the digits in blocks of two from right to left.

144,837: 14 + 48 + 37 = 99.

100

Ends with at least two zeros.

900 ends with 2 zeros

101

111

125

128

143

256

333

512

989

Form the alternating sum of blocks of two from

right to left.

Add the digits in blocks of three from right to left.

The number formed by the last three digits must

be divisible by 125.[2]

The number formed by the last seven digits must

be divisible by 128.[1][2]

Form the alternating sum of blocks of three from

right to left.

The number formed by the last eight digits must

be divisible by 256.[1][2]

Add the digits in blocks of three from right to left.

40,299: 4 - 2 + 99 = 101.

1,370,184: 1 + 370 + 184 = 555

2125 is divisible by 125.

11,280,000 is divisible by 128.

1,774,487: 1 - 774 + 487 = -286

225,600,000 is divisible by 256.

410,922: 410 + 922 = 1,332

The number formed by the last nine digits must be 1,512,000,000 is divisible by
divisible by 512.[1][2]

512.

Add the last three digits to eleven times the rest.

21758: 21 11 = 231; 758 + 231

= 989

999

Add the digits in blocks of three from right to left.

999,999: 999 + 999 = 1,998

1000

Ends with at least three zeros.

2000 ends with 3 zeros

https://en.wikipedia.org/wiki/Divisibility_rule
Finding Divisibility Rules for Large Numbers

Date: 12/21/2000 at 00:31:35

From: David
Subject: Seeking out divisibility rules
Is there any way to systematically find divisibility rules for any number n, where n > 10?
Date: 12/21/2000 at 11:40:03
From: Doctor Rob
Subject: Re: Seeking out divisibility rules
Thanks for writing to Ask Dr. Math, David.
Yes, there is a way. First of all, factor n into its prime power divisors:
n = p1^e1 * p2^e2 * ... * pr^er.
A number is divisible by n if and only if it is divisible by each prime power in this expression.
That reduces the problem to one where n is a prime power.
A number is not divisible by a prime power p^e if it is not divisible by the prime p itself, so a
necessary but not sufficient condition is divisibility by p. If the number is divisible by p, you can
divide it out, and see if the quotient is divisible by p^(e-1). That will reduce the problem to one
where n is a prime number p.
One way to find a test for divisibility by p is to find the smallest multiple of p of the form x*10^k

+ 1 or x*10^k - 1, where x is very small (preferably one digit). Then the test is that N is divisible
by p if and only if the number gotten from N by chopping off the last k digits, multiplying them
by x, and subtracting (or adding, respectively) that product to the rest of N, is divisible by p.
For example, if you want to test divisibility by 107, you might find that 107 is a factor of
1899999, so you can test for divisibility by chopping off the last five digits, multiplying that by
19, and adding that product from the rest of the digits of N. The result will be divisible by 107 if
and only if the N is. You can continue this until the number has at most five digits, then you have
to try dividing by 107 directly.
- Doctor Rob, The Math Forum
http://mathforum.org/dr.math/
Date: 12/21/2000 at 13:35:00
From: Doctor Greenie
Subject: Re: Seeking out divisibility rules
Yes, there is.
I'm not sure I could provide a rigorous mathematical justification for the method, so I'll just
demonstrate it for a few cases.
The method for any given n is based on the pattern of remainders formed when successive
powers of 10 are divided by n. The method is best demonstrated by examples; however, here is
an attempt to put the method in words:
To determine whether a number is divisible by n, proceed as follows:
(1) Multiply each digit in the 10^i column by the remainder when
10^(i+1) is divided by n.
(2) Add all the numbers obtained in step (1).
(3) The original number is divisible by n if and only if the number
obtained in step (2) is divisible by n
Let's first use this method to derive the familiar divisibility rule for 3. We start by finding the
remainders when successive powers of 10 are divided by 3, until a pattern is found:
power of 10 remainder when divided by 3
----------- ---------------------------

10^1 1
10^2 1
10^3 1
::
Here the pattern emerges immediately: every power of 10 leaves a remainder of 1 when divided
by 3. The rule that comes out of this method is as follows:
"a number is divisible by 3 if (and only if) the number (1*units
digit + 1*tens digit + 1*hundreds digit + ...) is divisible by 3"
This is equivalent to the familiar rule that a number is divisible by 3 if and only if the sum of its
digits is divisible by 3. (This method quickly obtains the corresponding familiar rule for
divisibility by 9, since every power of 10 also leaves a remainder of 1 when divided by 9.)
Perhaps you are familiar with the divisibility rule for 11: find the sum of the digits in the oddnumbered locations and the sum of the digits in the even-numbered locations and take the
difference; if the difference is divisible by 11, then the original number is. Let's see if we can
develop that rule using this method:
power of 10 remainder when divided by 11
----------- ---------------------------10^1 10
10^2 1
10^3 10
10^4 1
10^5 10
::
We can use a "trick" here to simplify our divisibility rule a bit. Wherever the remainder upon
dividing by 11 is 10, we can also say the "remainder" is -1. Then our table looks like this:
power of 10 remainder when divided by 11
----------- ----------------------------10^1 -1
10^2 1
10^3 -1
10^4 1
10^5 -1
::

And from this we can see how, using our method, we can get the familiar divisibility rule for 11.
Now let's use the method to obtain a divisibility rule for 7.
power of 10 remainder when divided by 7
----------- --------------------------10^1 3
10^2 2
10^3 6 (or -1)
10^4 4 (or -3)
10^5 5 (or -2)
10^6 1
10^7 3
10^8 2
10^9 6 (or -1)
::
Without trying to put the rule into words, let's use it in an example. The number 5497756005 is
divisible by 7. We can show this is so using our divisibility rule as follows:
(5*3)+(0*2)+(0*6)+(6*4)+(5*5)+(7*1)+(7*3)+(9*2)+(4*6)+(5*4)
= 15 + 0 + 0 + 24 + 25 + 7 + 21 + 18 + 24 + 20
= 154
and 154 is divisible by 7, so 5497756005 is also.
Note carefully how this sum of 154 was obtained. In the string of products that were added to get
the total of 154, the first digit in each product is a digit of the number whose divisibility is being
checked, starting with the units digit and moving left; and the second digit in each product is the
remainder when successive powers of 10 are divided by 7, starting with 10^1 for the units digit.
Here's another example, to find a divisibility rule for 13.
power of 10 remainder when divided by 13
----------- ---------------------------10^1 10 (or -3)
10^2 9 (or -4)
10^3 12 (or -1)
10^4 3
10^5 4
10^6 1

10^7 10 (or -3)

10^8 9 (or -4)
10^9 12 (or -1)
::
The number 3266497 is divisible by 13. We can show this is so using our divisibility rule as
follows:
(7*10) + (9*9) + (4*12) + (6*3) + (6*4) + (2*1) + (3*10)
= 70 + 81 + 48 + 18 + 24 + 2 + 30
= 273
and 273 is divisible by 13, so 3266497 is also.
Or we could keep the numbers smaller by using the negative remainders:
(7*-3) + (9*-4) + (4*-1) + (6*3) + (6*4) + (2*1) + (3*-3)
= (-21) + (-36) + (-4) + 18 + 24 + 2 + (-9)
= -26
It can be interesting to see what kinds of rules result from using this method on numbers for
which we already have divisibility rules. Consider the rule which results for divisibility by 6:
power of 10 remainder when divided by 6
----------- --------------------------10^1 4
10^2 4
10^3 4
::
Here the divisibility rule says a number is divisible if 4 times the sum of all the digits is divisible
by 6. This is equivalent to saying that it is divisible by 6 if twice the sum of the digits is divisible
by 3. And that is equivalent to the divisibility rule you are probably familiar with - that a number
is divisible by 6 if it is divisible by both 2 and 3.
So...
You CAN get divisibility rules for any number... but most of them are much harder to use than
long division (or other hand methods). And in this day of calculators, the divisibility rules are
useless except as a mathematical exercise.

- Doctor Greenie, The Math Forum

http://mathforum.org/dr.math/
Numbers divisible by 73 and 137
We use the fact that 73*137 = 10001 = 10^4 + 1. Mark off the number in groups of four digits
starting from the right, and add the four-digit groups together with alternating signs. The sum is
divisible by 73 or 137 if and only if the original number is.
Numbers divisible by 101
We use the fact that 101 = 10^2 + 1. Mark off the number in groups of two digits starting from
the right, and add the two-digit groups together with alternating signs. The sum is divisible by
101 if and only if the original number is.
Numbers divisible by 41 and 271
We use the fact that 41*271*9 = 99999 = 10^5 - 1. Mark off the number in groups of five digits
starting from the right, and add the five-digit groups together. The sum is divisible by 41 or 271
if and only if the original number is.