Prime Factorization Calculator - Find Prime Factors Instantly

Find the prime factorization of any number with our free online calculator. Displays all prime factors in exponential form and as a factor tree for easy understanding.

Number

Examples:

Understanding Prime Factorization

Prime factorization breaks down any composite number into its building blocks - the prime numbers that multiply together to create it. Just as molecules are made of atoms, every whole number greater than 1 is made of prime numbers multiplied together.

The Fundamental Theorem of Arithmetic guarantees that every number has exactly one prime factorization (ignoring order). This makes prime factorization a unique "fingerprint" for each number.

How to Find Prime Factorization

Method: Trial Division

Start with the smallest prime (2) and divide if possible
Keep dividing by 2 until you can't anymore
Move to the next prime (3), then 5, 7, 11, etc.
Continue until the quotient is itself prime
Write the result using exponents for repeated factors

Worked Examples

Example 1: Factorizing 60

60 ÷ 2 = 30

30 ÷ 2 = 15

15 ÷ 3 = 5

5 is prime, stop

60 = 2 × 2 × 3 × 5 = 2² × 3 × 5

Prime factorization: 2² × 3 × 5

Example 2: Factorizing 84

84 ÷ 2 = 42

42 ÷ 2 = 21

21 ÷ 3 = 7

7 is prime, stop

84 = 2 × 2 × 3 × 7 = 2² × 3 × 7

Prime factorization: 2² × 3 × 7

Example 3: Factorizing 100

100 ÷ 2 = 50

50 ÷ 2 = 25

25 ÷ 5 = 5

5 is prime, stop

100 = 2 × 2 × 5 × 5 = 2² × 5²

Prime factorization: 2² × 5²

Example 4: Factorizing 256 (Power of 2)

256 ÷ 2 = 128

128 ÷ 2 = 64

64 ÷ 2 = 32

32 ÷ 2 = 16

16 ÷ 2 = 8

8 ÷ 2 = 4

4 ÷ 2 = 2

2 is prime, stop

256 = 2⁸

Prime factorization: 2⁸

Example 5: Factorizing 1001

1001 is odd, skip 2

1001 ÷ 7 = 143

143 ÷ 11 = 13

13 is prime, stop

1001 = 7 × 11 × 13

Prime factorization: 7 × 11 × 13

Interesting: three consecutive primes!

Quick Fact

Prime factorization is the foundation of modern cryptography. RSA encryption, which secures online banking and e-commerce, relies on the fact that multiplying two large primes is easy, but factoring their product back is extremely hard. A 2048-bit RSA key would take classical computers billions of years to factor - though quantum computers could potentially break this someday.

Frequently Asked Questions

Why is 1 not considered a prime number?

If 1 were prime, prime factorization wouldn't be unique - you could add as many 1s as you want (6 = 2×3 = 1×2×3 = 1×1×2×3, etc.). Excluding 1 preserves the Fundamental Theorem of Arithmetic. Historically, 1 was considered prime until the 19th century.

What's the prime factorization of a prime number?

A prime number's factorization is just itself. For example, 17 = 17. It has only one prime factor (itself) with exponent 1. This makes sense - primes are the "atoms" that can't be broken down further.

How is prime factorization useful?

It's essential for finding GCD and LCM, simplifying fractions, solving Diophantine equations, understanding number properties (perfect squares have even exponents), and cryptography. It reveals the fundamental structure of numbers.

What's the fastest way to factor large numbers?

For hand calculation, trial division works up to about 10,000. For larger numbers, algorithms like Pollard's rho, quadratic sieve, or the general number field sieve are used. The largest factored number (as of 2024) has 829 bits - a massive computational effort.

Can negative numbers have prime factorization?

In standard arithmetic, prime factorization applies to positive integers only. You can factor -60 as -1 × 2² × 3 × 5, but -1 isn't considered prime. In more advanced number theory (Gaussian integers), negative and complex factorizations exist.

What are coprime numbers?

Two numbers are coprime (relatively prime) if they share no prime factors. Their GCD is 1. For example, 8 (2³) and 15 (3×5) are coprime. This concept is crucial in modular arithmetic and cryptography.

Other Free Tools

Search tools