Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

Divisibility Calculator


How to use Divisibility Calculator
  1. Pick the mode with the two buttons under Check Mode: Single Divisor tests one divisor, Common Divisors tests 2, 3, 4, 5, 6, 8, 9, 10 and 12 at once. Learn more about the modes
  2. Type the number to test in Number to Check. Learn more about the number
  3. In Single Divisor mode, type the divisor in Divide By; it must be a non-zero whole number. Learn more about the divisor
  4. Click Check. Single Divisor answers Yes with the quotient or No with the remainder; Common Divisors shows a grid of green and red boxes. Learn more about the results
  5. The panel on the right explains the selected mode, and its link opens the section below that explains it in full. Learn more about common divisors
  6. Click Reset to clear the boxes, the result and the grid. A red message appears for an empty box, a decimal, or a zero divisor. Learn more about messages
?
?
Result will appear here
Check if one number divides evenly into another. If the remainder is 0, the number is divisible. For example, 12 ÷ 3 = 4 with remainder 0, so 12 is divisible by 3. Learn more about divisibility































Getting Started with the Divisibility Calculator

DemoOne check in each mode, then Reset
Step 0 of 5
The divisibility calculator tests whether one number divides evenly into another. Choose your check mode: Single Divisor (test one specific divisor) or Common Divisors (test multiple divisors 2, 3, 4, 5, 6, 8, 9, 10, 12 at once).

In Single Divisor mode, enter the number to test in "Number to Check" and the divisor in "Divide By". For example, enter 2424 and 66 to verify that 2424 is divisible by 66 (result: 24÷6=424 ÷ 6 = 4, remainder 00).

Try testing 25÷625 ÷ 6: enter 2525 and 66. The calculator shows "No, 2525 is not divisible by 66. Remainder: 11" because 25÷6=425 ÷ 6 = 4 with remainder 11. Any non-zero remainder means not divisible.

Click Check to see results. For Single Divisor, you get a yes/no answer with the quotient or remainder. For Common Divisors, you see a color-coded grid: green (✓) for divisible, red (✗) for not divisible; for 2424 the green boxes are 2,3,4,6,8,122, 3, 4, 6, 8, 12 and the red ones 5,9,105, 9, 10. Use Reset to clear and test new numbers. What it means for one number to divide another is explained in understanding divisibility.

Using Single Divisor Mode

DemoDivisible, and not divisible with a remainder
Step 0 of 4
Select Single Divisor to test if one specific number divides evenly into another. This mode answers questions like "Is 4848 divisible by 77?" or "Does 55 divide evenly into 100100?"

Enter your number in "Number to Check" and the potential divisor in "Divide By". The calculator performs division and checks if the remainder is zero. For 48÷648 ÷ 6: quotient = 88, remainder = 00, so yes, 4848 is divisible by 66.

The result shows three pieces of information: divisibility status (yes/no), the quotient if divisible, or the remainder if not. Try 50÷750 ÷ 7: "No, not divisible. Remainder: 11" because 50=7×7+150 = 7 × 7 + 1; and 48÷748 ÷ 7 leaves remainder 66, since 48=7×6+648 = 7 × 6 + 6. Typing in a box clears the previous result.

This mode is useful for verifying calculations, checking if numbers are multiples, or testing divisibility before simplifying fractions. For 3648\frac{36}{48}, you might test if both are divisible by 66, 88, or 1212 to find the greatest common factor. Why a zero remainder is the whole test is explained in understanding divisibility.

Using Common Divisors Mode

DemoNine divisors at once
Step 0 of 4
Switch to Common Divisors to test divisibility by 2,3,4,5,6,8,9,102, 3, 4, 5, 6, 8, 9, 10, and 1212 simultaneously. This mode reveals patterns and properties of your number at a glance. Enter just one number and click Check.

The result displays a grid with nine boxes. Green boxes with ✓ show divisors that work; red boxes with ✗ show divisors that don't. Try entering 3636: you'll see green for 2,3,4,6,9,122, 3, 4, 6, 9, 12 and red for 5,8,105, 8, 10.

This visual grid helps identify number properties quickly. If 2,4,82, 4, 8 are all green, your number is divisible by all powers of 22 up to 88. If only 22 is green but 44 is red, your number is 2×odd2 × \text{odd}.

Common Divisors mode is excellent for learning divisibility rules, finding quick factorizations, or checking if a number is composite (if multiple divisors show green, it's not prime). Try 360360 to see it's divisible by all nine common divisors; 120120 fails only at 99. The rules behind each box are in divisibility rules and patterns.

Reading Results and Interpreting Output

DemoA remainder, two messages, Reset
Step 0 of 5
In Single Divisor mode, results appear as colored text. Green text starting with "Yes" means divisible, showing the quotient: "Yes, 2424 is divisible by 66. Result: 44". Orange/yellow "No" means not divisible, showing the remainder.

The remainder tells you how much is left over after division. For "2727 is not divisible by 55. Remainder: 22", this means 27=5×5+227 = 5 × 5 + 2. The remainder is always less than the divisor.

In Common Divisors mode, the grid uses color coding. Green boxes with ✓ indicate divisibility; red boxes with ✗ indicate non-divisibility. Each box is labeled with its divisor number (2, 3, 4, etc.) for easy reading.

Error messages appear in red. "Error: Enter a valid integer" means you left the number blank, typed text, or typed a decimal such as 2.52.5. "Error: Enter a valid divisor (non-zero integer)" means the divisor is 00, blank, or not an integer. Division by zero is undefined. The remainder the calculator reports is the modulo of the two numbers, as explained in divisibility and modular arithmetic.

Understanding Divisibility

A number aa is divisible by bb if a÷ba ÷ b gives a whole number with remainder 00. In mathematical notation: a÷b=qa \div b = q with a=b×qa = b × q for some integer qq. For example, 2424 is divisible by 66 because 24=6×424 = 6 × 4.

Written compactly, this is b∣ab \mid a — read b divides a. The bar is not a division sign and not a fraction: b∣ab \mid a is a statement that is either true or false, where a÷ba \div b is a number. It is also the reverse of the reading order most people expect, since the divisor comes first. The mark is set out in full at divisibility notation.

Divisibility is the foundation of many number theory concepts. If aa is divisible by bb, then bb is a factor of aa, and aa is a multiple of bb. The number 1212 is divisible by 1,2,3,4,6,121, 2, 3, 4, 6, 12—these are all factors of 1212.

Testing divisibility is equivalent to checking if the remainder (modulo) is zero. The calculator uses the modulo operation: if a mod b=0a \bmod b = 0, then aa is divisible by bb. This is why 15 mod 5=015 \bmod 5 = 0 confirms 1515 is divisible by 55.

Understanding divisibility helps with fraction simplification, finding common denominators, prime factorization, and solving modular arithmetic problems. It's a fundamental skill in elementary number theory and practical mathematics.

In the calculator this is the Single Divisor mode. The definition is in what is divisibility, the link to remainders in divisibility and remainders, and factors and multiples in factors (divisors).

Divisibility Rules and Patterns

Divisibility rules provide shortcuts for testing divisibility without full division. Divisible by 2: last digit is even (0,2,4,6,80, 2, 4, 6, 8). Try 4848: last digit 88 is even, so divisible by 22.

Divisible by 3: sum of digits is divisible by 33. For 123123: 1+2+3=61 + 2 + 3 = 6, and 66 is divisible by 33, so 123123 is divisible by 33. Divisible by 5: last digit is 00 or 55. Test 125125: ends in 55, so divisible by 55.

Divisible by 4: last two digits form a number divisible by 44. For 316316: the last two digits are 1616, and 16÷4=416 ÷ 4 = 4, so 316316 is divisible by 44. Divisible by 9: sum of digits is divisible by 99. Try 729729: 7+2+9=187 + 2 + 9 = 18, divisible by 99.

Divisible by 10: last digit is 00. Divisible by 6: divisible by both 22 and 33. Divisible by 12: divisible by both 33 and 44. These rules come from properties of base-10 number system and modular arithmetic.

The Common Divisors mode applies these nine tests at once: 3636 passes 2,3,4,6,9,122, 3, 4, 6, 9, 12 and fails 5,8,105, 8, 10, while 360360 passes all nine. Each rule is proved in divisibility by 2, divisibility by 3, divisibility by 5 and why these rules work.

Applications in Fraction Simplification

Divisibility testing is essential for reducing fractions. To simplify 2436\frac{24}{36}, test which numbers divide both 2424 and 3636. Using Common Divisors mode: both are divisible by 2,3,4,6,122, 3, 4, 6, 12.

The greatest common divisor is 1212, so divide both: 24÷1236÷12=23\frac{24÷12}{36÷12} = \frac{2}{3}. The divisibility calculator helps you quickly identify potential common divisors without trial-and-error division.

For complex fractions like 144192\frac{144}{192}, test both numbers with Common Divisors mode. You'll find both are divisible by 2,3,4,6,8,122, 3, 4, 6, 8, 12. Testing these as potential GCF candidates, you discover GCF = 4848, giving 144192=34\frac{144}{192} = \frac{3}{4}.

Divisibility also helps verify if a fraction is already in lowest terms. If numerator and denominator share no common divisors (other than 11), the fraction is fully reduced. Test 1528\frac{15}{28}: they share no common divisors, so it's already simplified. Common factors are treated in common factors and the greatest of them in listing factors.

Using Divisibility for Prime Testing

Divisibility testing helps identify composite numbers (non-prime). If a number is divisible by any number other than 11 and itself, it's composite. Use Common Divisors mode to quickly check.

Enter 7777 in Common Divisors mode: no common divisors show green, but this doesn't prove it's prime—you'd need to test all numbers up to 77≈8.77\sqrt{77} ≈ 8.77. However, 77=7×1177 = 7 × 11 is actually composite (divisible by 77 and 1111).

For small numbers, Common Divisors mode catches most composites. If any divisor shows green (except cases like 22 dividing even numbers you already know about), the number is definitely composite. Try 9191: no common divisors, but 91=7×1391 = 7 × 13.

To conclusively test primality, you'd need a prime number checker that tests all divisors up to the square root. Divisibility testing is a first step: if divisible by 2,3,52, 3, 5, etc., definitely not prime. If not, further testing needed. Prime numbers are introduced in prime numbers.

Divisibility and Modular Arithmetic

Divisibility is the foundation of modular arithmetic (mod or remainder arithmetic). Saying "aa is divisible by bb" is equivalent to "a≡0(modb)a \equiv 0 \pmod{b}" (a is congruent to 0 modulo b).

The remainder from divisibility testing is the modulo value. When the calculator shows "Remainder: 33" for 23÷523 ÷ 5, this means 23 mod 5=323 \bmod 5 = 3 or 23≡3(mod5)23 \equiv 3 \pmod{5}. Modular arithmetic uses these remainders for clock arithmetic, cryptography, and number theory.

Divisibility rules are modular arithmetic shortcuts. "Last digit even" for divisibility by 22 works because 10≡0(mod2)10 \equiv 0 \pmod{2}, so only the last digit matters. Similarly, "sum of digits" for divisibility by 33 works because 10≡1(mod3)10 \equiv 1 \pmod{3}.

Understanding the connection between divisibility and modulo helps solve congruence problems, Chinese Remainder Theorem applications, and cryptographic algorithms like RSA. The divisibility calculator shows modulo results (remainders) when numbers aren't divisible. The link between the two ideas is set out in modulo and divisibility and congruence.