Find All Divisors of an Integer
Enter any whole number to list its divisors, proper divisors, prime factorization, and more.
What is a divisor calculator?
A divisor calculator is a number theory tool that finds every integer that divides a given number with no remainder. If a number d divides another number n, then n ÷ d is a whole number. For example, the divisors of 12 are 1, 2, 3, 4, 6, and 12.
This calculator is designed for students, teachers, engineers, coders, and anyone who wants quick and accurate divisor analysis. In addition to listing divisors, it also reports proper divisors, divisor count, divisor sum, and prime factorization.
How to use this tool
- Enter any whole number (positive or negative).
- Click Calculate Divisors.
- Read the generated results immediately below the button.
- Use the optional display limit if your number has many divisors.
Example
If you enter 360, the calculator will show its full divisor list, sum of divisors, and prime factorization: 360 = 23 × 32 × 5. Because 360 has many factors, it is a useful practice value for divisibility patterns.
Why divisors matter
Divisors are fundamental in arithmetic and algebra. Here are a few common applications:
- Simplifying fractions: common divisors help reduce ratios to lowest terms.
- Greatest common divisor (GCD): central to modular arithmetic and equation solving.
- Least common multiple (LCM): useful for scheduling, cycles, and denominator alignment.
- Cryptography and coding: prime factorization and divisor behavior matter in algorithms.
- Data grouping: divisors help split objects into equal-size groups without leftovers.
How the calculator works (fast approach)
A naive method checks every value from 1 to n. A faster strategy checks only up to the square root of n. Why? Divisors come in pairs. If i divides n, then n/i is also a divisor.
For example, with 100: 1 pairs with 100, 2 pairs with 50, 4 pairs with 25, 5 pairs with 20, and 10 pairs with itself. After checking up to 10, all divisor pairs are already discovered.
Special cases to know
- 0: every nonzero integer divides 0, so it has infinitely many divisors.
- 1: has exactly one positive divisor: 1.
- Prime numbers: have exactly two positive divisors, 1 and itself.
- Negative inputs: have both positive and negative integer divisors.
Reading your result block
Positive divisors
These are the standard divisors most textbooks use in factor problems. The calculator always computes these from the absolute value of your input.
Proper divisors
Proper divisors are all positive divisors except the number itself. They are used in topics such as perfect numbers and abundant numbers.
Prime factorization
This shows how your number breaks into prime powers. Prime factorization is a compact way to understand divisor count and divisor sum formulas.
Quick divisor practice numbers
- 24 → small and easy to verify manually.
- 84 → good for pairing and prime decomposition practice.
- 97 → prime example (only 1 and 97).
- 1000 → useful for powers of 2 and 5.
Use this page as both a calculator and a mini-reference guide for integer divisibility. It is especially handy when you need exact factors quickly and want to avoid arithmetic mistakes.