Factor Calculator
Find all factors, factor pairs, prime factorization, divisor sum, and prime number classification for any positive integer.
All formulas and computation matrices for this calculator execute directly in your browser with zero latency. Enter your parameters to see instant results.
Who Uses This Calculation & Why Accuracy Matters
Students, algebra educators, computer programmers, cryptographers, and puzzle solvers use this factor calculator to list all integer divisors of any number, determine prime factorization with exponential multiplicities, and classify numbers as prime, composite, square, or perfect.
An elementary teacher finding all rectangular desk arrangements for a classroom of 36 students.
A computer science student analyzing the prime factors of a semi-prime integer N = 3,233.
A number theory enthusiast checking whether 28 is a "perfect number".
Number Classification by Divisor Properties
Mathematical categorization based on factor count and aliquot sums.
| Classification | Divisor Characteristic | Aliquot Sum s(n) | Example Numbers | Theoretical Significance |
|---|---|---|---|---|
| Prime Number | Exactly two distinct factors (1 and itself) | s(n) = 1 | 2, 3, 5, 7, 11, 13, 17... | Building blocks of all integers (Unique Factorization) |
| Composite Number | More than two distinct factors | s(n) > 1 | 4, 6, 8, 9, 10, 12, 14... | Can be factored into smaller non-trivial primes |
| Perfect Number | Equal to sum of proper divisors | s(n) = n | 6, 28, 496, 8,128 | Connected to Mersenne primes via Euclid-Euler theorem: 2^(p-1)(2ᵖ - 1) |
| Abundant Number | Sum of proper divisors exceeds number | s(n) > n | 12 (s=16), 18 (s=21), 24 (s=36) | Abundance index > 2 |
| Deficient Number | Sum of proper divisors is less than number | s(n) < n | All prime numbers, powers of 2, 8, 9, 10 | Most integers are deficient |
| Square Number | Odd total number of factors (repeated factor) | Varies | 1, 4, 9, 16, 25, 36, 49... | Factors pair up except the square root itself |
* Aliquot sum s(n) is the sum of all positive divisors of n excluding n itself.
Fundamental Theorem of Arithmetic & Divisor Function Equations
Every integer n > 1 can be uniquely factored into a product of prime numbers. The total number of positive divisors d(n) and sum of divisors σ(n) are computed directly from prime exponents.
Positive whole number to factorize.
Prime numbers dividing n.
Power of each prime factor in canonical factorization.
Total number of positive integer divisors.
Step-by-Step Worked Examples with Real Numbers
Worked Example 1: Full Factorization of 60
Canonical prime factorization.
Formula predicts exactly 12 factors.
All positive integer factors.
60 is an Abundant number.
Worked Example 2: Checking if 97 is Prime
Only need to test primes up to √n.
None divide evenly.
Confirmed prime.
Assumptions, Edge Cases & Common Calculation Mistakes
ℹ Underlying Algorithm Assumptions
- Operates on positive integers n ≥ 1.
- By definition, 1 is neither prime nor composite (it is a multiplicative unit).
- Negative integers have identical factor magnitudes paired with opposite signs.
⚠ 3 Common Mistakes to Avoid
- Classifying 1 as a prime number; primality requires exactly two distinct factors.
- Testing divisors past the square root of n; if a number has a factor greater than √n, its partner must be less than √n.
- Attempting trial division factorization on 500-digit RSA numbers (takes longer than the age of the universe).