Divisibility Rules & Divisor Explorer

Test divisibility rules from 2 to 13 with step-by-step explanations, divisor counts, and aliquot sums.

The Classical Divisibility Rules (2 through 13)

Divisibility rules allow you to determine whether an integer is divisible by a fixed divisor without performing long division, utilizing properties of base-10 modular arithmetic.

Common Divisibility Rules Summary

  • Rule for 3: Sum of all digits is divisible by 3.
  • Rule for 4: The last two digits form a number divisible by 4.
  • Rule for 7: Subtract double the last digit from the remaining number; the result must be divisible by 7.
  • Rule for 11: The alternating sum of digits (d₀ − d₁ + d₂ − …) must be divisible by 11.

Step-by-Step Worked Examples

Example: Testing 2,520

2,520 is the smallest positive integer divisible by all integers from 1 to 10. It has 48 divisors and an aliquot sum of 6,840, making it highly abundant.

Frequently Asked Questions

What is an aliquot sum?

The aliquot sum is the sum of all proper divisors of a number (all positive divisors excluding the number itself).

What is a perfect number?

A perfect number is a positive integer equal to the sum of its proper divisors (e.g., 6 = 1 + 2 + 3, and 28 = 1 + 2 + 4 + 7 + 14).