Divisibility Rules Calculator

The Divisibility Rules Calculator applies standard divisibility rules to any integer, showing whether it is divisible and explaining why.

Divisibility Rules Calculator Explained

This tool applies known divisibility tests to your input and reports a yes or no. It also shows the steps for popular divisors like 2, 3, 5, 9, 10, and 11. Where a quick rule exists, the tool demonstrates it. Where rules are longer, it summarizes the logic and shows the remainder.

Divisibility rules come from modular arithmetic. For example, a number is divisible by 3 if the sum of its digits is divisible by 3. The calculator walks through that test. For 11, it uses alternating sums of digits and checks if the result is a multiple of 11. The process avoids full division, which saves time and reduces errors.

You can test single divisors or a set like 2, 3, and 5 at once. The tool highlights which divisors work and which do not. It can also report the remainder when a number is not divisible. This makes it useful for mental math, homework, or quick checks in the workplace.

Divisibility Rules Formulas & Derivations

Divisibility tests rely on how numbers behave under place value. In base 10, each digit position is a power of 10. Many rules use the fact that 10 has simple remainders when divided by small integers. The patterns lead to tests involving last digits, sums of digits, or alternating sums.

• Divisible by 2: A number n is divisible by 2 if its last digit is even. This works because 10 ≡ 0 (mod 2), so only the last digit matters.
• Divisible by 3 or 9: Sum the digits. If the sum is divisible by 3 (or 9), so is n. This follows since 10 ≡ 1 (mod 3, 9), making n ≡ sum of digits.
• Divisible by 4 or 8: Check the last two digits for 4, or last three for 8. Because 100 ≡ 0 (mod 4) and 1000 ≡ 0 (mod 8), higher places vanish modulo these divisors.
• Divisible by 5 or 10: Last digit 0 or 5 for 5, and 0 for 10. This flows from 10 ≡ 0 (mod 5, 10).
• Divisible by 11: Compute the alternating sum of digits. If that sum is divisible by 11, so is n. The reason is 10 ≡ −1 (mod 11), so digits alternate signs.
• Divisible by 6 or 12: Use combination rules. For 6, check both 2 and 3. For 12, check both 3 and 4. These rely on least common multiples.

Some divisors have trickier tests. For 7, you can remove the last digit, double it, and subtract from the rest; repeat until small. If the final result is a multiple of 7, the original was too. Although more involved, the calculator can still evaluate and show the remainder.

How to Use Divisibility Rules (Step by Step)

Follow a simple strategy before reaching for long division. Identify the divisor and pick the matching rule. Apply the rule to the number’s digits. Confirm the result by a quick remainder check if needed.

• Spot last-digit rules first (2, 5, 10) to get a fast decision.
• Use digit sums for 3, 6, and 9 to avoid big arithmetic.
• Check the last two or three digits for 4 and 8.
• Compute an alternating digit sum for 11.
• For composite divisors like 6, test their prime factors.

If the rule is unclear, try a small remainder calculation. For example, divide the last two or three digits, or use mental math. The calculator shows both the rule and the remainder, so you can cross-check your steps.

Inputs and Assumptions for Divisibility Rules

The tool expects clear inputs and follows standard number theory assumptions. You can supply single integers or a list. You can also choose a divisor or a set of divisors. The defaults fit base-10 problems.

• Number: any integer, positive or negative, with optional spaces or commas.
• Divisor: any nonzero integer, typically from 2 to 100 for common rules.
• Multiple divisors: an optional list to test in one pass.
• Base: default is 10; most rules shown assume base 10.
• Show steps: toggle to view the applied rule and calculation.
• Remainder: toggle to show n mod d when not divisible.

Very large inputs are supported up to practical limits. For extreme sizes, the tool still applies digit-based rules without long division. Some rare divisors lack short rules; those return a remainder with a brief note.

Step-by-Step: Use the Divisibility Rules Calculator

Here’s a concise overview before we dive into the key points:

1. Enter your integer in the Number field.
2. Choose one divisor or select multiple from the list.
3. Optionally enable Show steps to see the rule in action.
4. Optionally enable Remainder to display n mod d.
5. Click Calculate to run the tests.
6. Review the results: pass or fail, steps, and remainder if shown.

These points provide quick orientation—use them alongside the full explanations in this page.

Worked Examples

You need to check if 1,764 is divisible by 3, 4, and 11 for a problem set. For 3, sum the digits: 1 + 7 + 6 + 4 = 18, and 18 is divisible by 3, so 1,764 passes. For 4, check the last two digits 64; 64 ÷ 4 = 16, so it passes. For 11, compute the alternating sum: (1 − 7 + 6 − 4) = −4, which is not a multiple of 11, so it fails. What this means: 1,764 is divisible by 3 and 4, but not by 11.

A shipping system batches items in packs of 6, 8, and 9. You have 7,200 items and need batch compatibility. For 6, check 2 and 3: last digit is 0 (even), and digit sum is 7 + 2 + 0 + 0 = 9, which is divisible by 3, so 6 works. For 8, check last three digits 200; 200 ÷ 8 = 25, so it works. For 9, digit sum 9 is divisible by 9, so it works. What this means: 7,200 fits evenly into packs of 6, 8, and 9.

Assumptions, Caveats & Edge Cases

These rules target integers in base 10. They give quick yes or no checks for many common divisors. Some divisors do not have a short digit rule, so the calculator reports the remainder instead.

• Zero is divisible by every nonzero integer; every test returns true when n = 0.
• Negative numbers follow the same rules; signs do not affect divisibility.
• Whitespace and group separators in the number are ignored.
• For large primes, the tool may show modular steps rather than a digit rule.
• Base-10 rules change if you switch to another base.

When several divisors are selected, the tool tests each individually. It does not assume relationships unless stated, such as 6 requiring both 2 and 3. If you need a least common multiple test, combine factor checks or run an LCM calculation separately.

Units and Symbols

Divisibility uses symbols rather than physical units. Understanding the notation helps you read the results and follow the steps. The table lists common symbols and how the calculator uses them.

Read “a | b” as “a divides b.” Congruence statements explain why digit tests work. The calculator may show a remainder using mod, or a factor relation using gcd.

Common Issues & Fixes

Most mistakes come from misreading the number or mixing rules. Slow down and match the test to the divisor. If the number is large, isolate only the digits that matter.

• Wrong rule: Verify you used 4’s last-two-digit rule, not 3’s digit sum.
• Digit sum error: Recount the digits or sum in parts, then add.
• Alternating sum for 11: Start from the right to keep the sign pattern steady.
• Composite divisor: Break it into prime factors and test each.

If uncertainty remains, run a quick remainder check. A small remainder confirms a near miss and shows how far off you are. Use the tool’s steps display to compare with your work.

FAQ about Divisibility Rules Calculator

Which divisors does the calculator support?

It supports all integers except zero. Fast, step-by-step rules are shown for common divisors like 2, 3, 4, 5, 6, 8, 9, 10, and 11.

Can it handle very large numbers?

Yes. Digit-based rules make large inputs manageable. The tool also computes remainders efficiently without long division.

How are negative numbers treated?

The sign does not affect divisibility. The tool applies each rule to the absolute value and keeps the sign for context.

Does it work in bases other than 10?

The default is base 10. If you switch bases, some rules change. The tool notes the base in the steps when that option is used.

Glossary for Divisibility Rules

Divisibility

A property where one integer divides another with no remainder.

Remainder

The amount left after dividing when the division is not exact.

Congruence

A relation where two numbers have the same remainder modulo a base.

Composite Number

An integer greater than one that has factors other than one and itself.

Prime Factor

A prime number that divides a given number exactly.

Least Common Multiple

The smallest positive integer that is a multiple of two or more integers.

Alternating Sum

A sum where digits are added and subtracted in a repeating pattern, used in the rule for 11.

Place Value

The value of a digit based on its position in the number, such as ones, tens, or hundreds.

Sources & Further Reading

Here’s a concise overview before we dive into the key points:

• Wikipedia: Divisibility rule — Overview of rules and proofs for many divisors.
• Wikipedia: Modular arithmetic — The theory behind digit tests and congruences.
• Khan Academy: Factors and multiples — Video lessons and practice on divisibility and factors.
• Art of Problem Solving: Divisibility rules — Competition-focused summaries and tips.
• Wolfram MathWorld: Divisibility Tests — Formal statements and references.

These points provide quick orientation—use them alongside the full explanations in this page.