How to Find the Prime Factorization of a Number

A prime number is an integer greater than 1 whose only positive divisors are 1 and itself: 2, 3, 5, 7, 11, 13, …. A composite number has a factor other than 1 and itself. The number 1 is neither prime nor composite.

Prime factorization writes n as a product of primes. By the fundamental theorem of arithmetic, every integer n > 1 has a factorization into primes that is unique up to order.

• 12 = 2 × 2 × 3 = 2² × 3
• 360 = 2³ × 3² × 5
• 17 = 17 (already prime)
• 100 = 2² × 5²

Writing repeated primes with exponents keeps large factorizations readable. Exponent notation is the same power language covered more broadly in the power calculator guide.

Factorization assumes a positive integer context for school and tool use. Zero and negatives are outside the usual “prime factors of n” homework story (absolute value can map a signed integer to a positive magnitude first — see the absolute value guide when signs appear).

A factor tree splits a number into two factors, then splits any composite branch, until every leaf is prime.

Method

1. Start with n at the root.
2. Find any pair of integers a × b = n with a > 1, b > 1 (often start by dividing by 2, 3, 5, …).
3. Draw branches to a and b.
4. If a branch is composite, split it again.
5. Stop when every leaf is prime. Multiply the leaves to recover n.

Example: 84

• 84 = 2 × 42
• 42 = 2 × 21
• 21 = 3 × 7
• Leaves: 2, 2, 3, 7 → 2² × 3 × 7

Different split orders (84 = 4 × 21 vs 6 × 14) yield the same multiset of prime leaves. That uniqueness is the point of the theorem — the tree shape can vary; the primes cannot.

For large n, trial division up to √n is the classic hand method. When n grows past comfortable mental math, the free prime factorization tree tool shows factor tree structure, exponent form, and related divisor stats.

Group identical primes and count them:

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

with primes p₁ < p₂ < … usually written in ascending order for standard form.

Examples

• 72 = 2 × 2 × 2 × 3 × 3 → 2³ × 3²
• 500 = 2² × 5³
• 97 = 97¹ (or simply 97)

Exponent form makes products and GCDs mechanical: to multiply factorizations, add exponents of matching primes; to take powers of n, multiply every exponent. Roots and perfect powers also become visible — n is a perfect square if every exponent is even.

When you only need p^a style evaluation (not full factorization), the power calculator evaluates bases and exponents directly.

If n = p₁^a₁ × … × pₖ^aₖ, every positive divisor of n has the form p₁^b₁ × … × pₖ^bₖ with 0 ≤ bᵢ ≤ aᵢ.

Number of positive divisors = (a₁ + 1)(a₂ + 1)…(aₖ + 1).

Example: 360 = 2³ × 3² × 5

• Divisor count = (3+1)(2+1)(1+1) = 4 × 3 × 2 = 24
• Sample divisors: 1, 2, 3, 4, 5, 6, 8, 9, 10, …, 360

Many factorization tools also report the sum of divisors (σ(n)), which is useful in number-theory classifications (perfect, abundant, deficient numbers). You do not need that sum for basic fraction work, but it is a free consequence of the same prime data.

Listing divisors by hand for huge n is tedious; use exponent counting first, then generate only the divisors you need.

Once two numbers are in prime exponent form, GCD and LCM are min/max games on exponents:

• GCD — take the minimum exponent for each prime that appears in both
• LCM — take the maximum exponent for each prime that appears in either

Example

48 = 2⁴ × 3, 180 = 2² × 3² × 5.

• GCD = 2² × 3 = 12
• LCM = 2⁴ × 3² × 5 = 720

You can also compute GCD with the Euclidean algorithm without full factorization; factorization shines when you already need primes for other reasons or when teaching structure. Dedicated workflows live in the GCD and LCM calculator guide and the matching GCD LCM calculator.

Simplifying ratios and fractions is the same idea: cancel shared prime factors. The ratio simplifier guide focuses on reducing a:b to lowest terms — factorization is the engine underneath.

Enter a positive integer, read the tree or prime list, and copy exponent form for homework or notes.

1. Open the free prime factorization tree tool.
2. Enter a positive integer within the tool’s supported range.
3. Review the factor tree or ordered prime factors.
4. Copy the exponent form (for example 2³ × 3² × 5).
5. Note divisor count or sum of divisors if shown.
6. Cross-check a small example by hand so you trust the layout.

Client-side tools are ideal for classwork and coding interviews. Cryptographic-scale integers (hundreds of digits) need specialized algorithms beyond a browser factor tree — school and contest sizes are the intended fit here.

Watch for these errors:

• Stopping at a composite leaf — every leaf must be prime (for example leaving 9 unsplit)
• Treating 1 as a prime factor — omit 1 from the product
• Missing a repeated factor — 12 is 2² × 3, not 2 × 3
• Confusing factors with multiples — factors divide n; multiples are n, 2n, 3n, …
• Assuming uniqueness of tree shape — shapes vary; prime multiset does not
• Trial dividing past √n without reason — if no prime factor ≤ √n remains, the cofactor is prime

Practice on 60, 84, 100, and 360 until exponent form feels automatic. Then verify with the prime factorization tree and connect reduced fractions via the ratio simplifier.

This guide is educational. Contest time limits, CAS software, and research factorization of huge integers follow different tooling — use what matches your n and context.