Guide

THE TOOLBOX / SCHOOL & NUMBER THEORY

Prime Factorization Calculator —
Factor Tree, Division Ladder & GCD / LCM.

Break any integer into its unique prime factors with an interactive visual factor tree, step-by-step trial division ladder, exponential notation, full divisor list, and a multi-number GCD (GCF) & LCM solver.

Examples:
Trial Division Ladder (6 steps)
Prime DivisorDividendQuotient
2360180
218090
29045
34515
3155
551
Composite Number·Abundant Number
Exponential Prime Factorization
2³ × 3² × 5
Expanded: 2 × 2 × 2 × 3 × 3 × 5
Distinct Primes
3
Prime Factors (Ω)
6
Total Divisors τ(n)
24
Sum of Divisors σ(n)
1,170
Visual Factor TreeHighlighted nodes = Prime factors
360218029024531535
All Positive Divisors (24)
1234568910121518202430364045607290120180360

NUMBER THEORY REFERENCE

Understanding prime factorization, factor trees, and GCD vs. LCM.

1. Fundamental Theorem of Arithmetic

Every integer greater than 1 is either a prime number or can be expressed as a unique product of prime powers (ignoring order). For instance, 360 = 2³ × 3² × 5 has (3+1)(2+1)(1+1) = 24 total positive divisors.

2. First 25 Prime Numbers (Under 100)

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97.

3. Worked GCD & LCM Example

Given 12 = 2² × 3 and 18 = 2 × 3²: take the minimum power of shared primes for GCD = 2¹ × 3¹ = 6, and the maximum power of all primes for LCM = 2² × 3² = 36. Notice that GCD × LCM = 6 × 36 = 216 = 12 × 18.

Frequently Asked Questions

What is prime factorization?

Prime factorization writes any whole number greater than 1 as a unique product of prime numbers. For example, 360 = 2 × 2 × 2 × 3 × 3 × 5, or 2³ × 3² × 5 in exponential form. By the Fundamental Theorem of Arithmetic, every integer > 1 has exactly one prime factorization.

How do you read a factor tree?

Start with the target number at the top and split it into two factors—typically its smallest prime divisor on the left and the remaining quotient on the right. Keep branching composite numbers until every leaf is a prime number. Multiplying all highlighted prime leaves gives the original number.

How do you use prime factorization to find GCD and LCM?

Write each number in exponential prime form. For the Greatest Common Divisor (GCD / GCF), multiply only the shared prime bases raised to their smallest exponents. For the Least Common Multiple (LCM), multiply every prime base that appears in any number raised to its highest exponent.

Is 1 a prime number?

No. A prime number must have exactly two distinct positive divisors: 1 and itself. Because 1 only has a single divisor, mathematicians exclude 1 from the primes so that prime factorizations remain unique.

What do τ(n) and σ(n) mean in the results?

τ(n) is the total number of positive divisors of n, found by adding 1 to each prime exponent and multiplying them together. σ(n) is the sum of all positive divisors of n; comparing σ(n) − n against n classifies the integer as Perfect, Abundant, or Deficient.