Divisibility Test Tool

Test many divisors at once with clear rule explanations. Review quotients, remainders, and digit summaries. Learn number patterns through fast checks, exports, and examples.

Test a number against many divisors

Use whole numbers only. Very large integers are supported.
Separate divisors with commas or spaces.
Choose how divisors should appear in the report.
Optional. Add a continuous divisor range.
Optional. Used with range start.

Example data table

Number Divisor Divisible Reason
3780 2 Yes Last digit is 0, so the number is even.
3780 3 Yes Digit sum is 18, and 18 is divisible by 3.
3780 4 Yes Last two digits are 80, and 80 is divisible by 4.
3780 11 No The alternating digit difference is not a multiple of 11.
3780 12 Yes The number passes both the 3 and 4 tests.

Formula used

The main rule is: n = d × q + r, where n is the number, d is the divisor, q is the integer quotient, and r is the remainder.

A number is divisible by a divisor exactly when: r = 0. In modular form, that means: n mod d = 0.

Common shortcut rules used by the tool:

How to use this calculator

  1. Enter any whole number in the main input field.
  2. Add divisors in the list field, separated by commas or spaces.
  3. Optionally enter a divisor range to test many values quickly.
  4. Choose ascending or descending sort order.
  5. Enable the filter if you only want successful tests shown.
  6. Press Run Divisibility Test to generate the report.
  7. Review divisibility, remainders, quotients, and rule explanations.
  8. Use the CSV or PDF buttons to export your displayed results.

Frequently asked questions

1. What does a divisibility test show?

It shows whether a whole number divides evenly by another number. This tool also reports the remainder, the integer quotient, and a short rule explanation.

2. Does a negative sign change divisibility?

No. Divisibility depends on the absolute value of the number. For example, -24 is still divisible by 2, 3, 4, 6, 8, and 12.

3. Can I test many divisors at once?

Yes. You can enter a custom list, add a range, or use both together. Duplicate divisors are automatically removed before calculation.

4. Why do 3 and 9 use the digit sum?

In base ten, a number and its digit sum leave the same remainder when divided by 3 or 9. That makes the digit-sum shortcut reliable.

5. Why is the test for 11 different?

The rule for 11 uses alternating digit sums. If their difference is a multiple of 11, the original number is divisible by 11.

6. What happens when the number is 0?

Zero is divisible by every nonzero divisor. The tool will return a remainder of 0 and an integer quotient of 0 for every tested divisor.

7. Are the quotient values exact?

The quotient shown is the integer quotient from whole-number division. When the remainder is 0, that quotient is also the exact division result.

8. Can this tool handle very large integers?

Yes. The divisibility checks use digit-by-digit string methods, so the tool can process very large whole numbers without relying only on standard integer size limits.

Related Calculators

Modular Exponentiation Fast Power CalculatorReverse Euclidean algorithm calculatorfast modular exponentiation calculatorLarge number modulo calculatormodular congruence solverpisano period calculatoreuler totient calculatorprime number checkerextended euclidean calculatormodular inverse calculator

Important Note: All the Calculators listed in this site are for educational purpose only and we do not guarentee the accuracy of results. Please do consult with other sources as well.