Prime Factorization & Factor Tree Calculator

Find all prime factors, divisors, and factor pairs for any integer.

Understanding Prime Factorization & Factor Trees

Prime factorization is the mathematical process of decomposing a composite number into a product of prime numbers. According to the Fundamental Theorem of Arithmetic, every integer greater than 1 is either a prime itself or can be represented uniquely as a product of prime numbers, up to the order of the factors.

Canonical Prime Factorization Formula

n = p₁a₁ × p₂a₂ × … × pₖaₖ

Where p₁, p₂, …, pₖ are distinct prime numbers in ascending order, and each exponent aᵢ ≥ 1 indicates the multiplicity of that prime factor.

Step-by-Step Worked Examples

Example: Factor Tree of 72

Divide by the smallest prime factor: 72 ÷ 2 = 36; 36 ÷ 2 = 18; 18 ÷ 2 = 9; 9 ÷ 3 = 3; 3 ÷ 3 = 1.
Collecting factors: 2 × 2 × 2 × 3 × 3 = 2³ × 3².

Example: Factoring 1,991

1,991 is not divisible by 2, 3, 5, or 7. Testing 11: 1,991 ÷ 11 = 181. Since 181 is a prime number, the prime factorization is 11 × 181.

Frequently Asked Questions

What is prime factorization?

Prime factorization is the process of breaking down a composite integer into the exact set of prime numbers that multiply together to equal the original number.

Why is 1 not included in prime factorizations?

By mathematical definition, 1 is neither prime nor composite. If 1 were considered prime, prime factorizations would lose their unique representation because you could multiply by 1 indefinitely (e.g. 6 = 2 × 3 = 1 × 2 × 3 = 1 × 1 × 2 × 3).

How does a factor tree work?

A factor tree visually branches a number into two factors repeatedly until all branch ends (leaves) are prime numbers.