To find every factor of a number, test the integers from 1 up to its square root and pair each divisor with its partner. This finds them all in about √n steps instead of n.
Here's the efficient method, plus patterns that reveal primes and perfect squares.
The square-root pairing method
For each number d from 1 to √n that divides n, both d and n ÷ d are factors. For 36: 1×36, 2×18, 3×12, 4×9, 6×6 → factors 1, 2, 3, 4, 6, 9, 12, 18, 36.
Spotting primes and perfect squares
- Exactly two factors → the number is prime.
- An odd number of factors → a perfect square (one pair repeats, like 6×6).
Counting factors with prime powers
If n = 2³ × 3² × 5, the number of factors is (3+1)(2+1)(1+1) = 24. Get the prime form from the Prime Factorization Calculator.
Try it instantly
The Factors Calculator lists every factor, shows the factor pairs as a diagram, and reports the count and sum.
- Test divisors only up to the square root, then pair them.
- Two factors → prime; odd count → perfect square.
- Factor count = product of (each prime exponent + 1).
- Pairing makes finding factors fast even for large numbers.
Frequently asked questions
What's the fastest way to find all factors?
Check each integer up to the square root; whenever one divides evenly, it and its partner (n ÷ it) are both factors.
Why do perfect squares have an odd number of factors?
Because one factor pair is a number times itself (e.g. 6×6=36), which is counted once, making the total odd.
How do I find the number of factors without listing them?
Use the prime factorization: multiply (each exponent + 1) together.
Math educators and engineers building free, accurate calculators with step-by-step solutions, visual diagrams and AI insights.
Related articles
How to Find the LCM: 4 Methods Explained (2026 Guide)
Learn how to find the Least Common Multiple (LCM) using four methods — prime factorization, the GCF formula, l…
How to Find the GCD Using the Euclidean Algorithm
The Euclidean algorithm finds the Greatest Common Divisor in just a few steps. Learn how it works, why it work…
How to Simplify Fractions Fast (Using the GCD)
Simplify any fraction to lowest terms in one step using the Greatest Common Divisor. Learn the method, see wor…