Skip to main content
math

Divisibility Test Calculator

Test whether a number is divisible by common divisors (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12). Learn and apply the quick divisibility rules.

Reviewed by Chase FloiedUpdated

This free online divisibility test calculator provides instant results with no signup required. All calculations run directly in your browser — your data is never sent to a server. Enter your values below and see results update in real time as you type. Perfect for everyday calculations, homework, or professional use.

If blank, tests divisibility by 2 through 12

How to Use This Calculator

1

Enter your input values

Fill in all required input fields for the Divisibility Test Calculator. Most fields include unit selectors so you can work in your preferred unit system — metric or imperial, whichever matches your problem.

2

Review your inputs

Double-check that all values are correct and that you have selected the right units for each field. Incorrect units are the most common source of calculation errors and can produce results that are off by factors of 2, 10, or more.

3

Read the results

The Divisibility Test Calculator instantly computes the output and displays results with units clearly labeled. All calculations happen in your browser — no loading time and no data sent to a server.

4

Explore parameter sensitivity

Try adjusting individual input values to see how the output changes. This is a quick and effective way to develop intuition about how different parameters influence the result and to identify which inputs have the largest effect.

Formula Reference

Divisibility Test Calculator Formula

See calculator inputs for the governing equation

Variables: All variables and their units are labeled in the calculator interface above. Input fields accept values in multiple unit systems — select your preferred unit from the dropdown next to each field.

When to Use This Calculator

  • Use the Divisibility Test Calculator when you need a quick mathematical result without writing out all the steps manually, saving time on repetitive calculations.
  • Use it to verify hand calculations on tests or assignments and catch arithmetic mistakes.
  • Use it when teaching or explaining mathematical concepts to others, demonstrating how changing inputs affects the result.
  • Use it to explore the behavior of mathematical functions across a range of inputs.

About This Calculator

The Divisibility Test Calculator is a free mathematical calculation tool for students, educators, and professionals who need quick, reliable results. Test whether a number is divisible by common divisors (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12). Learn and apply the quick divisibility rules. The underlying algorithms implement well-established mathematical formulas and numerical methods. Results are computed instantly in the browser. This tool is useful for learning, verification of hand calculations, and rapid exploration of mathematical relationships. All computation happens locally — no data is sent to a server.

About Divisibility Test Calculator

Divisibility tests are quick rules for determining whether one integer evenly divides another without performing long division. These mental math shortcuts have been used for centuries and remain practical for simplifying fractions, checking arithmetic, and understanding number properties. The rules exploit patterns in our base-10 number system. Divisibility by 2 depends only on the last digit; divisibility by 3 or 9 depends on the digit sum; divisibility by 4 depends on the last two digits; divisibility by 5 depends on the last digit being 0 or 5. More complex rules exist for 7, 11, and 13. These tests are the foundation for trial division in factoring algorithms and connect deeply to modular arithmetic. Understanding divisibility is essential for working with fractions, finding GCF and LCM, and recognizing prime numbers. The divisibility rules for 3 and 9 are closely related to the concept of digital roots and casting out nines.

The Math Behind It

Each divisibility rule can be proven using modular arithmetic and the properties of base-10 representation. Since 10 ≡ 0 (mod 2, 5), only the last digit matters. Since 10 ≡ 1 (mod 3, 9), a number n = aₖ10ᵏ + ... + a₁10 + a₀ ≡ aₖ + ... + a₁ + a₀ (mod 3 or 9). Since 10² ≡ 0 (mod 4), only the last two digits matter. Since 10 ≡ −1 (mod 11), divisibility by 11 uses alternating sums: a₀ − a₁ + a₂ − a₃ + .... The rule for 7 is more complex: double the last digit and subtract from the rest, repeating until small enough to check. The divisibility rule for 6 requires divisibility by both 2 and 3, since 6 = 2 × 3 and gcd(2,3) = 1. Similarly, divisibility by 12 requires divisibility by both 3 and 4. These rules generalize: for any composite modulus n = a × b with gcd(a,b) = 1, divisibility by n is equivalent to divisibility by both a and b.

Formula Reference

Divisibility by 2

Last digit is even (0, 2, 4, 6, 8)

Variables: Check only the ones digit

Divisibility by 3

Sum of digits is divisible by 3

Variables: Add all digits and check the sum

Divisibility by 9

Sum of digits is divisible by 9

Variables: Add all digits and check the sum

Worked Examples

Example 1: Testing 2520

Test if 2520 is divisible by 2, 3, 4, 5, 6, 7, 8, 9, 10

Step 1:By 2: last digit 0 is even ✓
Step 2:By 3: digit sum 2+5+2+0 = 9, divisible by 3 ✓
Step 3:By 5: last digit is 0 ✓
Step 4:By 7: 2520/7 = 360 ✓
Step 5:By 9: digit sum 9, divisible by 9 ✓
Step 6:2520 = 2³ × 3² × 5 × 7, divisible by all of 1-10

2520 is divisible by every integer from 1 to 10

Common Mistakes & Tips

  • !Confusing the digit sum rule for 3 with the rule for 9 — both use digit sums, but with different divisors.
  • !Applying the last-digit rule (for 2, 5) to divisors like 3 or 7 where it doesn't work.
  • !Thinking a number divisible by 2 and 3 is automatically divisible by 6 × 2 = 12 — it's divisible by 6, but 12 requires divisibility by 4 as well.
  • !Forgetting to check the alternating sum rule correctly for 11.

Related Concepts

Used in These Calculators

Calculators that build on or apply the concepts from this page:

Frequently Asked Questions

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

Because 10 ≡ 1 (mod 3) and 10 ≡ 1 (mod 9). Therefore 10^k ≡ 1 for any k, which means a number's remainder when divided by 3 or 9 equals the remainder of its digit sum.

Is there a simple divisibility test for 7?

Yes, but it's less intuitive: take the last digit, double it, and subtract from the remaining number. Repeat until you can easily check divisibility. For example, 203 → 20 − 6 = 14, and 14 is divisible by 7, so 203 is too.