Prime Factorization Calculator & Factor Tree

Break any integer into prime factors with an interactive visual SVG factor tree, step-by-step division ladder, canonical prime-power notation, and complete divisor list.

Examples:
Exponential Prime Factorization
360 = 2³ × 3² × 5
Expanded Product
2 × 2 × 2 × 3 × 3 × 5
2 ×33 ×25
Visual Factor Tree
Prime leafComposite node
323618224520360
Step-by-Step Division Ladder
1.360 ÷ 2 = 180
2.180 ÷ 2 = 90
3.90 ÷ 2 = 45
4.45 ÷ 3 = 15
5.15 ÷ 3 = 5
6.5 ÷ 5 = 1
All Positive Divisors24 divisors · Sum σ(n) = 1170
1234568910121518202430364045607290120180360

What Is Prime Factorization? (Fundamental Theorem of Arithmetic)

Prime factorization expresses a positive integer greater than 1 as a product of prime numbers. For example, 360 = 2 × 2 × 2 × 3 × 3 × 5 = 2³ × 3² × 5.

By the Fundamental Theorem of Arithmetic, every integer greater than 1 has one and only one prime factorization (up to the ordering of factors). This uniqueness powers greatest common divisor (GCD), least common multiple (LCM), fraction reduction, and modern RSA cryptography.

Prime Factorization Reference Table for Common Numbers

Quickly compare exponential prime factorizations, expanded products, and total divisor counts for frequently searched integers.

Number Prime Factorization Expanded Product Divisors
12 2² × 3 2 × 2 × 3 6
18 2 × 3² 2 × 3 × 3 6
24 2³ × 3 2 × 2 × 2 × 3 8
36 2² × 3² 2 × 2 × 3 × 3 9
48 2⁴ × 3 2 × 2 × 2 × 2 × 3 10
51 3 × 17 3 × 17 4
57 3 × 19 3 × 19 4
60 2² × 3 × 5 2 × 2 × 3 × 5 12
72 2³ × 3² 2 × 2 × 2 × 3 × 3 12
91 7 × 13 7 × 13 4
100 2² × 5² 2 × 2 × 5 × 5 9
120 2³ × 3 × 5 2 × 2 × 2 × 3 × 5 16
144 2⁴ × 3² 2 × 2 × 2 × 2 × 3 × 3 15
256 2⁸ 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 9
360 2³ × 3² × 5 2 × 2 × 2 × 3 × 3 × 5 24
1000 2³ × 5³ 2 × 2 × 2 × 5 × 5 × 5 16
1001 7 × 11 × 13 7 × 11 × 13 8
1024 2¹⁰ 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 11
2025 3⁴ × 5² 3 × 3 × 3 × 3 × 5 × 5 15
2026 2 × 1013 2 × 1013 4

How to Factor a Number by Hand

  1. 1

    Start with the smallest prime number (2) and divide repeatedly while the quotient stays an integer.

  2. 2

    Move on to the next primes (3, 5, 7, 11, …) and continue dividing until the remaining quotient is 1 or a prime number itself.

  3. 3

    Group repeated prime factors with exponents — for example, three 2s become 2³. To count total positive divisors, add 1 to each exponent and multiply: for 360 = 2³ × 3² × 5¹, τ(360) = (3+1)(2+1)(1+1) = 24.

Frequently Asked Questions

What is the difference between factors and prime factors?

Factors (divisors) are all integers that divide a number evenly (for 12: 1, 2, 3, 4, 6, 12). Prime factors are only those divisors that are themselves prime numbers (for 12: 2 and 3, giving 12 = 2² × 3).

How does a factor tree work?

A factor tree starts with your target integer at the root and splits composite nodes into two smaller factors until every branch ends in a prime leaf. Multiplying all green prime leaves reproduces the original number.

How do I count the total number of positive divisors from prime factorization?

Write n = p₁^a₁ × p₂^a₂ × … × pₖ^aₖ. The exact number of positive divisors is τ(n) = (a₁ + 1)(a₂ + 1)…(aₖ + 1).

Why is prime factorization important in cryptography?

Multiplying two large 300-digit primes takes microseconds, whereas recovering the two primes from their product is computationally intractable with classical algorithms — the mathematical foundation of RSA encryption.

Prime Number Tools & Reference Guides

Explore dedicated charts, visual factor trees, range generators, and step-by-step proofs for commonly searched numbers.