Prime Factorization Calculator
Free prime factorization calculator. Break any number into its prime factors with a factor tree diagram and step-by-step working.
Prime Factorization
Comprehensive Guide: Prime Factorization, Factor Trees & Fundamental Arithmetic
Learn how to decompose any composite integer into unique prime factors, construct canonical factor trees, and express results in exponential notation.
1. The Fundamental Theorem of Arithmetic
The Fundamental Theorem of Arithmetic (also known as the Unique Factorization Theorem) states that every integer greater than 1 either is a prime itself or can be represented as the product of prime numbers in a way that is completely unique, up to the ordering of the factors.
Formally, any integer N ≥ 2 has a unique canonical prime factorization:
where p₁ < p₂ < ... < pₖ are distinct prime numbers and each exponent aᵢ ≥ 1 is a positive integer. Prime numbers serve as the immutable "atomic elements" of multiplication.
2. Factor Tree Decomposition vs. Inverted Division Stacks
Two pedagogical methods are widely used to construct prime factorizations manually:
1. The Factor Tree Method
Split the composite number into any two recognizable factors (e.g. 72 = 8 × 9). Next, branch each factor into sub-factors (8 = 2 × 4 = 2 × 2 × 2 and 9 = 3 × 3). Continue until all terminating leaf nodes on the tree are prime numbers.
2. The Repeated Division Ladder (Upside-Down Division)
Divide the number sequentially by the smallest available prime divisor. Write the quotient beneath, and repeat division until the quotient reaches 1:
2 | 360
2 | 180
2 | 90
3 | 45
3 | 15
5 | 5
1 --> 360 = 2³ × 3² × 5¹
3. Worked Example: Factorizing 2,520 Completely
Determine the complete canonical prime factorization of 2,520.
Step 1: Test smallest prime 2: 2520 ÷ 2 = 1260
Step 2: Test 2 again: 1260 ÷ 2 = 630
Step 3: Test 2 again: 630 ÷ 2 = 315 (odd, no more 2s)
Step 4: Test prime 3: Sum of digits 3+1+5=9 (divisible by 3): 315 ÷ 3 = 105
Step 5: Test 3 again: 1+0+5=6: 105 ÷ 3 = 35 (no more 3s)
Step 6: Test prime 5: Ends in 5: 35 ÷ 5 = 7
Step 7: 7 is prime: 7 ÷ 7 = 1 (complete).
Canonical Representation:
2,520 = 2³ × 3² × 5¹ × 7¹
4. Finding Total Number of Divisors Using Prime Powers
A powerful application of canonical prime factorization is calculating the total number of positive divisors of a number without listing them. If N = p₁^(a₁) × p₂^(a₂) × ... × pₖ^(aₖ), the divisor count formula is:
For 2,520 = 2³ × 3² × 5¹ × 7¹:
d(2,520) = (3 + 1)(2 + 1)(1 + 1)(1 + 1) = 4 × 3 × 2 × 2 = 48 divisors!
5. Common Mistakes in Prime Factorization
- Stopping with composite leaves on factor trees: Expressing
60 = 4 × 15is a valid factorization, but not a prime factorization, because 4 and 15 are composite. Each must be decomposed to(2 × 2) × (3 × 5) = 2² × 3 × 5. - Including 1 in the prime factor list: Writing
1 × 2 × 3is mathematically incorrect because 1 is not a prime number.
6. Frequently Asked Questions (FAQ)
What is the prime factorization of a prime number?
The prime factorization of a prime number p is simply p¹ (itself raised to the power 1).
How does prime factorization help find square roots?
For any perfect square, all prime exponents are even integers. To extract the square root, simply divide each prime exponent by 2. For example, 144 = 2⁴ × 3². Taking square root: √(144) = 2^(4/2) × 3^(2/2) = 2² × 3¹ = 12.