Free Divisibility Test Calculator

Divisibility Tests and Why They Matter

Checking whether one integer divides another without a remainder is a fundamental math skill, often called a divisibility test. Instead of performing long division, you can rely on clever shortcuts known as divisibility rules. These rules save enormous time when working with large numbers, and they are the backbone of many arithmetic and number‑theory problems.

A modern free divisibility test calculator automates these shortcuts. You enter any integer, and the tool instantly reveals which divisors from 2 to 13 work. It can also explain the reasoning behind each rule, making it a powerful divisibility rules calculator for students, teachers, and anyone who needs a quick number divisibility checker. Whether you are verifying homework or exploring number patterns, this online helper turns abstract math divisibility rules into concrete, step‑by‑step results.

How the Free Divisibility Test Calculator Works

The tool offers two distinct modes.

• Summary Mode: After you type in a whole number, the calculator shows a clear list of all integers between 2 and 13 that divide it evenly. This gives an instant overview of the number’s divisibility properties.
• Details Mode: Pick one divisor from 2 to 13. The calculator displays the exact rule for that divisor and walks you through the application on your specific number. This feature makes it a true divisible by calculator — you choose the divisor, and it does the checking.

For example, enter 360 in Summary mode; the output tells you that 360 is divisible by 2, 3, 4, 5, 6, 8, 9, 10, and 12. In Details mode with divisor 8, it explains “last three digits 360 → 360 ÷ 8 = 45, remainder 0 → divisible.” Both modes are designed to be intuitive and educational.

Key Divisibility Rules You Should Know

All divisibility rules hinge on the base‑10 representation. They fall into categories based on whether you examine single digits, groups of digits, or sums of digits.

Simple End‑Digit Tests: 2, 5, and 10

These tests are the easiest because they only involve the last digit.

• Divisibility by 2: The number is divisible by 2 if its final digit is 0, 2, 4, 6, or 8.
• Divisibility by 5: The number is divisible by 5 if it ends in 0 or 5.
• Divisibility by 10: The number is divisible by 10 if it ends in 0.

Why these work? A number can be written as $10 \cdot Q + d$ with $d$ as the last digit. Since $10 \cdot Q$ is a multiple of 2, 5, and 10, the whole number inherits the divisibility of the last digit. More generally, for a divisor $2^n$ or $5^n$ you need to examine the last $n$ digits.

Using the Last Two or Three Digits: 4, 25, and 8

Divisibility by 4: Look at the number formed by the last two digits. If that two‑digit number is a multiple of 4, then the whole number is divisible by 4. For instance, 7,836 → last two digits 36, and 36 is divisible by 4 (36 ÷ 4 = 9), so 7,836 is divisible by 4. The reason is that 100 (and any multiple of 100) is a multiple of 4; the remainder depends only on the final two digits.

Divisibility by 25: Only four possibilities for the last two digits: 00, 25, 50, or 75. Because $100$ is a multiple of 25, higher place values contribute nothing to the remainder modulo 25.

Divisibility by 8: The rule is trickier because 8 is $2^3$. The straightforward test checks whether the last three digits form a number divisible by 8. Mentally dividing three‑digit numbers can be slow, so there is a two‑step shortcut:

• If the hundreds (third‑last) digit is even, the number is divisible by 8 iff the last two digits are divisible by 8.
• If the hundreds digit is odd, the number is divisible by 8 iff (last two digits + 4) is divisible by 8.

Example: 348 → hundreds digit 3 is odd, last two digits 48 → 48 + 4 = 52, and 52 is not divisible by 8, so 348 is not divisible by 8. Compare with 248 (hundreds digit even, last two digits 48 divisible by 8) → 248 is divisible by 8. This shortcut stems from the fact that $100$ divided by 8 leaves remainder 4, so an odd hundreds digit adds an extra 4 to the remainder.

Rules Based on Digit Sum: 3 and 9

These are among the most popular math divisibility rules because they are simple to apply even for huge numbers.

• Divisibility by 3: Compute the sum of all digits. If that sum is a multiple of 3, the original number is divisible by 3.
• Divisibility by 9: Compute the sum of all digits. If that sum is a multiple of 9, the original number is divisible by 9.

Example – 572,841: digit sum = 5 + 7 + 2 + 8 + 4 + 1 = 27. Since 27 is divisible by 9 (and also by 3), the number is divisible by both 3 and 9.

Why it works: Write a number as $n = a_0 + 10a_1 + 100a_2 + 1000a_3 + \dots$. Because $10^k = 9\times(111\ldots1) + 1$, each term $10^k a_k$ equals a multiple of 9 plus $a_k$. Therefore $n = 9\cdot(\dots) + (a_0 + a_1 + a_2 + \dots)$. The leftover “9 times something” part is always divisible by 9 and 3, so the remainder of $n$ modulo 3 or 9 is exactly the remainder of the digit sum. Consequently, the digit sum must be divisible by 3 (or 9) for the whole number to be divisible.

The Alternating‑Sum Rule: 11

There are two equally valid methods for 11:

1. Alternating sum of digits: Start from the rightmost digit, subtract the next, add the next, and so on. If the result (ignoring sign) is a multiple of 11, the number is divisible by 11.
   Example – 2,728 → 8 − 2 + 7 − 2 = 11, which is divisible by 11, so 2,728 is divisible by 11.

2. Block of two digits: Split the number into groups of two digits from the right, then sum those two‑digit numbers normally. If the sum is a multiple of 11, the original number passes.
   Example – 2,728 → 28 + 27 = 55, and 55 is a multiple of 11, confirming divisibility.

Both methods exploit the fact that $10 \equiv -1 \pmod{11}$, causing the place values to alternate in sign.

More Challenging Tests: 7 and 13

Tests for 7 and 13 are less straightforward but can be mastered with practice.

Divisibility by 7: Several procedures exist. The most common:

• Take the last digit, double it, and subtract that from the rest of the number (ignoring the last digit). If the result is divisible by 7, so is the original number. Repeat if necessary.
  Example – 315: last digit 5, double is 10; rest = 31; 31 − 10 = 21; 21 ÷ 7 = 3, so 315 is divisible by 7.

• A variation uses nine times the last digit instead of two times: subtract $9d$ from the rest. Both versions arise from the fact that $10 \equiv 3 \pmod{7}$; adjusting the multiplier changes the test but the logic remains the same.

• A completely different technique divides the number into blocks of three digits from the right and computes their alternating sum (rightmost block positive, next negative, and so on). If that sum is a multiple of 7, the whole number is divisible by 7.

Divisibility by 13: The same three‑block alternating sum works for 13. Take the blocks of three digits, alternate signs, and check whether the result is divisible by 13.

Example – 9,111,414: blocks = 414, 111, 9; alternating sum = 414 − 111 + 9 = 312. Since 312 ÷ 13 = 24 exactly, 9,111,414 is divisible by 13. All these rules can be verified using modular arithmetic: $10^3 \equiv -1 \pmod{7}$ and $10^3 \equiv -1 \pmod{13}$, which is why the three‑digit block method works for both 7 and 13.

Composite Divisors Using Prime Factorization

When the divisor is not prime – for example 6, 12, 15, 18, or 20 – you can decompose it into its prime‑power factors and apply the relevant simpler tests. The number must pass all component tests simultaneously.

Target divisor	Prime‑power decomposition	Required simpler tests
6	2 × 3	divisible by 2 and by 3
12	2² × 3 = 4 × 3	divisible by 4 and by 3
15	3 × 5	divisible by 3 and by 5
18	2 × 3² = 2 × 9	divisible by 2 and by 9
20	2² × 5 = 4 × 5	divisible by 4 and by 5

The rule for 20 can be rephrased in a more direct form: a number is divisible by 20 if its tens digit is even and its ones digit is 0. Proof: divisibility by 5 forces the last digit to be 0 or 5; it cannot be 5 because then the number would not be even, and it must be even to satisfy divisibility by 4. After that, the last two digits form a multiple of 4 only when the tens digit is even (00, 20, 40, 60, 80). This step‑by‑step reasoning is exactly what the Details mode of the calculator illustrates.

Putting It All Together with the Calculator

Instead of memorising every rule, you can rely on the free divisibility test calculator to do the heavy lifting. Type any integer – small or large – and get an instant list of its divisors in the 2–13 range. The Summary mode gives you the complete picture, while the Details mode shows how each rule is applied, reinforcing your understanding of math divisibility rules. Whether you use it as a divisible by calculator to check a specific divisor or as a number divisibility checker to explore a number’s properties, the tool is designed to be fast, accurate, and educational.

The next time you face a number like 3,847,692 and wonder whether it is divisible by 3, 7, or 11, let the divisibility rules calculator handle it – you will get the answer and learn the reasoning in seconds.