How to Find Prime Factors of a Number (2026)

Prime factorization breaks any positive integer down into a product of prime numbers. Every integer greater than 1 has exactly one prime factorization — a fact known as the Fundamental Theorem of Arithmetic. For example, 360 = 2³ × 3² × 5. Use the Prime Factorization tool to do this instantly for any number up to billions.

Trial Division: How It Works

The standard manual method is trial division. Start with the smallest prime, 2, and divide the number repeatedly until it no longer divides evenly. Move to the next prime (3, 5, 7, …) and repeat. Stop when the quotient reaches 1. The primes you divided by, with their counts, are the prime factors.

For 84: divide by 2 → 42, divide by 2 → 21, divide by 3 → 7, divide by 7 → 1. Result: 84 = 2² × 3 × 7. You only need to test primes up to the square root of the original number — if no prime up to √n divides n, then n is itself prime.

Common Factorizations at a Glance

Where Prime Factorization Is Used

Finding prime factors is a practical operation, not just a classroom exercise. Computing the greatest common divisor (GCD) and least common multiple (LCM) of two numbers — needed when adding fractions or scheduling repeating events — both rely on prime factorizations. Cryptography builds on the hardness of factoring very large numbers: RSA encryption is secure precisely because factoring a 2048-bit number is computationally infeasible with known algorithms.

In everyday arithmetic, factorization helps simplify fractions, find common denominators, and recognize whether a number is prime. A number with only itself as its prime factor (e.g. 13 = 13¹) is prime by definition.

Use the Prime Factorization to do this instantly.