Divisibility Rules Calculator

Test Numbers for Divisibility by 9, 18, 27, 36, 45, 54, 63, 72, and more!

Divisibility Checker

Divisibility Rules Overview

Divisibility Rules Summary

Divisor	Rule	Example (Divisible)	Example (Not Divisible)
9	Sum of digits is divisible by 9.	18 (1+8=9)	19 (1+9=10)
18	Divisible by both 2 and 9.	36 (Even, 3+6=9)	27 (Odd, 2+7=9)
27	Sum of digits is divisible by 27 (less common rule, often sum of groups of 3 digits). For simplicity, check divisibility by 3 and 9. If divisible by 9, check if the quotient is divisible by 3.	81 (8+1=9, 81/9=9, 9 is div by 3)	18 (1+8=9, 18/9=2, 2 not div by 3)
36	Divisible by both 4 and 9.	72 (Ends in 72, div by 4; 7+2=9)	45 (Div by 9, but not by 4)
45	Divisible by both 5 and 9.	90 (Ends in 0, div by 5; 9+0=9)	36 (Div by 9, but not by 5)
54	Divisible by both 2 and 27.	108 (Even, 1+0+8=9, 108/9=12, 12 is div by 3)	81 (Not even)
63	Divisible by both 7 and 9.	126 (1+2+6=9; 126 / 9 = 14, which is divisible by 7)	99 (9+9=18; 99 / 9 = 11, not divisible by 7)
72	Divisible by both 8 and 9.	144 (Last 3 digits 144 div by 8; 1+4+4=9)	81 (Div by 9, not by 8)
Any Multiple of 9 (e.g., 18, 27, 36…)	If the number is divisible by 9, and also by the other factor (e.g., 2 for 18, 4 for 36, 5 for 45), then it’s divisible by the multiple. For higher multiples of 9 (like 27, 45, 63, 81), it’s often easier to check for divisibility by 9 AND the other prime factors (e.g., 3 for 27, 5 for 45, 7 for 63). A number divisible by 9 is also divisible by 3.	108 (Divisible by 9 & 4)	99 (Divisible by 9 but not 4)

Understanding Divisibility Rules for Multiples of 9

What are Divisibility Rules for 9, 18, 27, 36, 45, 54, 63, 72 (and Beyond)?

Divisibility rules are shortcuts in mathematics that allow us to determine if a number is evenly divisible by another number without performing long division. For multiples of 9, these rules often build upon the fundamental rule for 9 itself. A number’s divisibility by 9 is determined by the sum of its digits. If that sum is divisible by 9, the original number is also divisible by 9.

This principle extends elegantly to other multiples of 9. For instance, for a number to be divisible by 18, it must satisfy two conditions: it must be divisible by 9 (sum of digits divisible by 9) AND it must be divisible by 2 (it must be an even number). Similarly, for 36, the number must be divisible by both 9 and 4.

Who Should Use These Rules? Students learning arithmetic and number theory, educators seeking to explain mathematical concepts, mathematicians verifying calculations, and anyone interested in number patterns will find these rules invaluable. They are fundamental tools for developing number sense.

Common Misconceptions: A frequent mistake is to assume that if a number is divisible by 9, it’s automatically divisible by all its multiples (like 18, 27, etc.). This is incorrect. For example, 27 is divisible by 9, but not by 18 because it’s odd. Another misconception is that the sum-of-digits rule applies universally to all divisors. While it’s a powerful rule for 3 and 9, it doesn’t directly apply to divisors like 7 or 11 without modification.

The Core Logic: Divisibility by 9 Explained

The divisibility rule for 9 is rooted in modular arithmetic and the properties of base-10 representation. Any integer ‘N’ can be represented as a sum of its digits multiplied by powers of 10. For example, the number 162 can be written as:

N = 1 * 10^2 + 6 * 10^1 + 2 * 10^0 = 100 + 60 + 2 = 162

Now, consider the powers of 10 modulo 9:

• 10^0 = 1 ≡ 1 (mod 9)
• 10^1 = 10 ≡ 1 (mod 9)
• 10^2 = 100 ≡ 1 (mod 9)
• 10^n ≡ 1 (mod 9) for any non-negative integer n

This means any power of 10 leaves a remainder of 1 when divided by 9.

Therefore, N modulo 9 can be expressed as:

N ≡ (1 * 1 + 6 * 1 + 2 * 1) (mod 9)

N ≡ (1 + 6 + 2) (mod 9)

N ≡ 9 (mod 9)

N ≡ 0 (mod 9)

So, the number N is divisible by 9 if and only if the sum of its digits is divisible by 9. This forms the basis for checking divisibility by any multiple of 9.

Extending to Multiples of 9 (18, 27, 36, 45, 54, 63, 72…)

To check if a number is divisible by a multiple of 9, say ‘M’, where M = 9 * k, we often need to check two conditions:

1. The number must be divisible by 9 (using the sum of digits rule).
2. The number must also be divisible by ‘k’.

Let’s break this down for key divisors:

• 18: M = 18 = 9 * 2. Check divisibility by 9 AND divisibility by 2 (i.e., the number must be even).
• 27: M = 27 = 9 * 3. Check divisibility by 9 AND divisibility by 3. A number divisible by 9 is already divisible by 3, so this becomes: check if the number is divisible by 9, and then check if the *quotient* (Number / 9) is divisible by 3. Alternatively, for larger numbers, we can sum digits in groups of three (e.g., 123,456 -> 123 + 456) and check if that sum is divisible by 27.
• 36: M = 36 = 9 * 4. Check divisibility by 9 AND divisibility by 4 (i.e., the number formed by the last two digits must be divisible by 4).
• 45: M = 45 = 9 * 5. Check divisibility by 9 AND divisibility by 5 (i.e., the number must end in 0 or 5).
• 54: M = 54 = 9 * 6. Check divisibility by 9 AND divisibility by 6 (which means it must be divisible by both 2 and 3). Since divisibility by 9 implies divisibility by 3, this simplifies to: check divisibility by 9 AND divisibility by 2 (i.e., the number must be even).
• 63: M = 63 = 9 * 7. Check divisibility by 9 AND divisibility by 7. This requires applying the rule for 9 and then separately testing for 7.
• 72: M = 72 = 9 * 8. Check divisibility by 9 AND divisibility by 8 (i.e., the number formed by the last three digits must be divisible by 8).
• 81: M = 81 = 9 * 9. Check divisibility by 9. If the sum of digits is divisible by 9, the number is divisible by 9. If the sum of digits is ALSO divisible by 81, the original number is divisible by 81. More commonly, we check if the sum of digits is divisible by 9, and then check if the quotient (Number / 9) is divisible by 9.

The calculator above automates these checks. When you input a number and select a base divisor (which must be a multiple of 9), it applies the relevant combined rules.

Variables Table: Divisibility Concepts

Key Variables in Divisibility Analysis

Variable	Meaning	Unit	Typical Range
N	The number being tested for divisibility.	Integer	Any positive integer (or potentially zero/negative depending on context).
D	The divisor (the number N is being checked against).	Integer	Typically small integers (e.g., 2, 3, 4, 5, 9, 10) or specific multiples like 18, 27, 36…
Sum of Digits (S)	The sum obtained by adding all the digits of N.	Integer	Depends on N; can be small (e.g., 9 for 18) or large (e.g., 27 for 99999).
Quotient (Q)	The result of N divided by D (N / D).	Integer or Decimal	Depends on N and D. If N is divisible by D, Q is an integer.
Base Divisor (M)	A specific multiple of 9 chosen for testing (e.g., 18, 36, 72).	Integer	Selected from a predefined list (e.g., 9, 18, …, 180).
Factor ‘k’	The factor such that M = 9 * k.	Integer	Calculated based on M (e.g., k=2 for M=18, k=4 for M=36).

Practical Examples

Let’s apply these rules to concrete examples:

1. Test Number: 729, Base Divisor: 27
   
   Steps:
   1. Check divisibility by 9: Sum of digits = 7 + 2 + 9 = 18. Since 18 is divisible by 9, 729 is divisible by 9.
   2. Check divisibility by the other factor (k=3, since 27 = 9 * 3): Calculate the quotient when divided by 9: 729 / 9 = 81.
   3. Is the quotient (81) divisible by 3? Yes, 8 + 1 = 9, which is divisible by 3.

   Result: 729 is divisible by 27.

2. Test Number: 1152, Base Divisor: 72
   
   Steps:
   1. Check divisibility by 9: Sum of digits = 1 + 1 + 5 + 2 = 9. Since 9 is divisible by 9, 1152 is divisible by 9.
   2. Check divisibility by the other factor (k=8, since 72 = 9 * 8): Check if the number formed by the last three digits (152) is divisible by 8. 152 / 8 = 19. Yes, it is divisible by 8.

   Result: 1152 is divisible by 72.

3. Test Number: 99, Base Divisor: 18
   
   Steps:
   1. Check divisibility by 9: Sum of digits = 9 + 9 = 18. Since 18 is divisible by 9, 99 is divisible by 9.
   2. Check divisibility by the other factor (k=2, since 18 = 9 * 2): Is the number even? No, 99 is odd.

   Result: 99 is NOT divisible by 18.

How to Use This Divisibility Rules Calculator

Using the calculator is straightforward:

1. Enter the Number: In the “Enter a Number” field, type the integer you want to test.
2. Select the Base Divisor: From the dropdown menu, choose the multiple of 9 (e.g., 18, 36, 72) you want to check for divisibility.
3. Click “Check Divisibility”: The calculator will process the number based on the selected divisor.

Reading the Results:

• The main result will clearly state whether the number IS or IS NOT divisible by the selected divisor.
• Intermediate values will show key calculations, such as the sum of the digits and the check against the secondary factor (e.g., even number check, last two digits check).
• The explanation section briefly outlines the rule applied.

Decision-Making Guidance: Use this calculator to quickly verify divisibility for homework problems, mathematical puzzles, or to understand number properties better. If the result shows “Is Divisible,” you know the number divides evenly. If it shows “Is NOT Divisible,” there will be a remainder.

Key Factors Affecting Divisibility Results

While divisibility rules are deterministic for integers, understanding the underlying principles helps:

1. The Base Rule for 9: This is the foundation. All rules for multiples of 9 rely on the sum of digits being divisible by 9. A mistake here cascades.
2. The Secondary Factor (k): For a number M = 9 * k to divide N, both 9 and k must divide N. The nature of k (e.g., 2, 4, 8 for even divisors; 3, 5, 7 for prime divisors) dictates the specific additional check needed.
3. Even/Odd Property: Crucial for divisors like 18 (needs 2), 36 (needs 4), 54 (needs 2), 72 (needs 8). An odd number cannot be divisible by an even number.
4. Divisibility by 4, 8: The rules for 4 and 8 depend only on the last two or three digits, respectively. This simplifies checking large numbers.
5. Divisibility by 3 vs. 27/81: Divisibility by 9 implies divisibility by 3. However, the reverse isn’t true. For 27 or 81, we need to ensure the number is divisible by 9 *and* that the quotient (N/9) is also divisible by 3 or 9, respectively.
6. Prime Factorization: Ultimately, divisibility is about prime factors. A number divisible by M must contain all prime factors of M (with at least the same multiplicity). For M = 9*k = 3^2 * k, the number N must have at least two factors of 3 and all prime factors of k.
7. Magnitude of the Number (N): While the rules work regardless of size, larger numbers require careful digit summing or application of the last-digit rules (for 4, 8). The calculator handles this complexity.
8. The Selected Base Divisor (M): The choice of divisor directly determines the rules applied. Testing for 18 requires different logic than testing for 36, even though both are multiples of 9.

Frequently Asked Questions (FAQ)

What is the simplest way to check if a number is divisible by 9?

Add all the digits of the number together. If the sum is divisible by 9 (e.g., 9, 18, 27), then the original number is divisible by 9.

Can a number be divisible by 9 but not by 18?

Yes. For example, 27 is divisible by 9 (2+7=9), but not by 18 because it is an odd number. A number must be divisible by both 9 and 2 to be divisible by 18.

How does the calculator handle very large numbers?

The calculator uses standard JavaScript number handling, which can represent integers up to a certain limit (Number.MAX_SAFE_INTEGER). For numbers beyond this, specialized libraries would be needed, but for typical educational and everyday use, it’s sufficient.

Is there a simple rule for divisibility by 27?

The most common method is: first, check if the number is divisible by 9. If it is, divide the number by 9. Then, check if the resulting quotient is divisible by 3. If both conditions are met, the original number is divisible by 27.

Why are multiples of 9 important in divisibility rules?

The number 9 has unique properties in base-10 systems because 10 leaves a remainder of 1 when divided by 9 (10 ≡ 1 mod 9). This property makes the sum-of-digits rule work perfectly for 9 and allows for easy extension to its multiples.

What if the sum of digits is a very large number (e.g., for 999,999,999)?

If the initial sum of digits is still large but clearly divisible by 9 (like 81), you can apply the rule recursively. For 999,999,999, the sum is 81. Since 81 is divisible by 9, the original number is divisible by 9. You could also check if 81 is divisible by 81 to confirm divisibility by 81.

Does the calculator check for divisibility by 7?

This calculator focuses specifically on divisibility by 9 and its multiples (18, 27, 36, etc.). Divisibility by 7 uses a different rule (often involving subtracting twice the last digit from the rest of the number) and is not included here.

Can I check divisibility by numbers that are NOT multiples of 9?

No, this calculator is specifically designed for divisibility rules related to the number 9 and its multiples. For other divisors, you would need a different tool or apply their respective rules manually.