Factors Calculator

How Does the Formula Work?

A factor (or divisor) of a positive integer n is any positive integer that divides n with no remainder. Finding factors is one of the most fundamental operations in number theory and has practical applications in simplifying fractions, finding common denominators, and solving divisibility problems.

How Factor Finding Works

To find all factors of a number n, we only need to check integers from 1 up to the square root of n. This is because factors always come in pairs: if i is a factor of n, then n/i is also a factor. For 60, we check 1 through 7 (since √60 ≈ 7.75) and discover six pairs: (1, 60), (2, 30), (3, 20), (4, 15), (5, 12), and (6, 10). This gives us all 12 factors. For a perfect square like 36, the pair (6, 6) counts as a single factor, which is why perfect squares always have an odd number of factors.

Prime Factorization

Every integer greater than 1 can be expressed as a unique product of prime numbers — this is the Fundamental Theorem of Arithmetic. To find the prime factorization, we repeatedly divide by the smallest prime factor. For 60: divide by 2 to get 30, divide by 2 to get 15, divide by 3 to get 5, and 5 is prime. So 60 = 2² × 3 × 5. Prime factorization is the key to many calculations: the number of factors equals the product of (exponent + 1) for each prime. For 60: (2+1)(1+1)(1+1) = 3 × 2 × 2 = 12 factors, exactly matching our count above.

Number Classification

This calculator classifies numbers based on the sum of their proper divisors (all factors except the number itself). A perfect number equals its proper divisor sum — 6 (1+2+3 = 6) and 28 (1+2+4+7+14 = 28) are the first two. Perfect numbers are rare: only 51 are known. An abundant number has a proper divisor sum greater than itself — 12 is the smallest (1+2+3+4+6 = 16 > 12). A deficient number has a proper divisor sum less than itself — all prime numbers are deficient since their only proper divisor is 1. About 75% of positive integers are deficient.

Factor Count from Prime Factorization

There is an elegant formula connecting prime factorization to the total number of factors. If n = p₁ᵃ × p₂ᵇ × p₃ᶜ, then the number of factors is (a+1)(b+1)(c+1). For 360 = 2³ × 3² × 5¹, the factor count is (3+1)(2+1)(1+1) = 4 × 3 × 2 = 24. This works because each factor of 360 is formed by choosing an exponent for 2 (0, 1, 2, or 3), an exponent for 3 (0, 1, or 2), and an exponent for 5 (0 or 1). The total combinations give the total factors. The sum of factors has a similar formula: σ(n) = (p₁ᵃ⁺¹−1)/(p₁−1) × (p₂ᵇ⁺¹−1)/(p₂−1) for each prime factor.

Practical Applications

Factor finding has many everyday math uses. Simplifying fractions requires finding common factors — to simplify 36/60, find that their greatest common factor is 12, giving 3/5. In scheduling problems, the least common multiple (built from factors) determines when events coincide. Teachers use factors to create equal groups: 30 students can be divided into groups of 1, 2, 3, 5, 6, 10, 15, or 30. Cryptography relies heavily on prime factorization — the RSA encryption algorithm is built on the difficulty of factoring very large numbers into their prime components.