How to Find the Prime Factors of a Number

Every whole number greater than 1 has a hidden prime pattern. Sometimes it appears quickly, as in 35 = 5 × 7. Sometimes it hides behind repeated factors, as in 72 = 2 × 2 × 2 × 3 × 3. Finding the prime factors of a number means breaking that number down until only primes remain — no composite parts left, no loose pieces, just the prime-number structure underneath.

A prime factor is not just any divisor. It must divide the number exactly, and it must also be a prime number. So 6 is a factor of 36, but it is not a prime factor because 6 can still be split into 2 × 3. The prime factors of 36 are 2 and 3, with repetition giving the full prime factorization: 36 = 2² × 3².

Prime Factors and Prime Factorization Are Related but Not Identical

The phrase prime factors usually means the prime numbers that divide a number. The phrase prime factorization means the full product of those primes, including repeated copies and exponents.

Small difference. Big mathematical meaning.

The repeated factors matter. Saying that 84 has prime factors 2, 3, and 7 is true, but it does not fully rebuild the number. To rebuild it exactly, the repeated 2 must stay visible: 84 = 2 × 2 × 3 × 7.

The Mathematical Rule Behind Every Prime Factorization

Prime factorization works because of the Fundamental Theorem of Arithmetic. It says that every integer greater than 1 can be written as a product of prime numbers in exactly one way, apart from the order of the factors.

For example, 90 can be split in different first moves:

• 90 = 9 × 10
• 90 = 6 × 15
• 90 = 2 × 45

Yet all roads end at the same prime factorization: 90 = 2 × 3² × 5. The order may change. The primes do not.

This is why factor trees, repeated division, and trial division can all give the same final answer. They are different paths through the same number. Underneath, the number has only one prime identity.

How the Basic Search for Prime Factors Works

The most direct method is trial division. It checks whether small prime numbers divide the target number with no remainder. When a prime divides evenly, that prime is recorded, and the number is reduced by division.

For 180, the process can be understood like this:

• 180 is even, so 2 is a prime factor. 180 ÷ 2 = 90.
• 90 is still even, so another 2 appears. 90 ÷ 2 = 45.
• 45 is divisible by 3. 45 ÷ 3 = 15.
• 15 is divisible by 3. 15 ÷ 3 = 5.
• 5 is prime, so it remains as the final factor.

The full factorization is 180 = 2² × 3² × 5.

Notice how the number shrinks after each exact division. That shrinking is not a trick; it is the reason the method stays readable for many ordinary numbers.

Why Divisibility Comes First

A prime number only becomes a prime factor when it divides the number exactly. Remainders reject candidates.

For 91, the small checks tell the story:

• 91 is not divisible by 2 because it is odd.
• 91 is not divisible by 3 because 9 + 1 = 10, and 10 is not divisible by 3.
• 91 is not divisible by 5 because it does not end in 0 or 5.
• 91 is divisible by 7, since 91 ÷ 7 = 13.

So the prime factorization is 91 = 7 × 13. Clean, short, done.

Why Checking up to the Square Root Is Enough

When a number has a factor pair, one factor must be less than or equal to the square root unless both factors are the same. This gives a natural stopping point.

Take 221. Its square root is a little less than 15. So a search for small prime divisors only needs to test primes up to 13: 2, 3, 5, 7, 11, and 13.

Since 221 ÷ 13 = 17, the factorization is 221 = 13 × 17. If no prime up to the square root divides a number, the number itself is prime.

This square-root idea keeps factor searches from becoming wasteful. It also explains why a prime check and a factor search are closely connected.

Using a Factor Tree to See the Prime Factors

A factor tree breaks a number into two factors, then keeps splitting any composite factor until every branch ends in a prime. The shape can vary. The final prime leaves stay the same.

For 360, one possible factor tree begins with 36 × 10:

• 360 = 36 × 10
• 36 = 6 × 6
• 6 = 2 × 3
• 10 = 2 × 5

Gathering the prime leaves gives 2, 2, 2, 3, 3, and 5. In exponent form:

360 = 2³ × 3² × 5

A factor tree works especially well when a number has visible factor pairs. It gives the eye something to follow. For larger numbers, repeated division often feels cleaner.

Different Trees, Same Prime Result

Start 360 another way: 360 = 8 × 45. Then 8 = 2 × 2 × 2 and 45 = 3 × 3 × 5. The result still becomes 2³ × 3² × 5.

That consistency is not luck. It comes from unique factorization.

Using Repeated Division With Prime Numbers

Repeated division arranges the same idea in a compact vertical form. A prime divisor is chosen, the number is divided, and the quotient continues downward until the remaining value is 1.

For 420, the chain looks like this in plain text:

420 ÷ 2 = 210
210 ÷ 2 = 105
105 ÷ 3 = 35
35 ÷ 5 = 7
7 ÷ 7 = 1

The prime factors are the divisors used on the left:

420 = 2² × 3 × 5 × 7

This method makes repeated primes easy to spot. The two divisions by 2 become the exponent 2². If a prime appears four times, it becomes p⁴, and so on.

Choosing Which Prime Divisors to Test

For hand work, the early primes carry most of the load. Testing them in order keeps the factorization organized and reduces mistakes.

• 2: any even number has 2 as a prime factor.
• 3: if the digit sum is divisible by 3, the number is divisible by 3.
• 5: numbers ending in 0 or 5 are divisible by 5.
• 7, 11, 13: these often appear in medium-sized examples and catch many factors after 2, 3, and 5 fail.

The search should not include 1. Although 1 divides every whole number, it is not prime. Including it would break the uniqueness of prime factorization, because 60 could become 1 × 2 × 2 × 3 × 5, or 1 × 1 × 2 × 2 × 3 × 5, and so on. Mathematics avoids that confusion by keeping 1 outside the primes.

Prime Factorization in Exponent Form

Exponent form records repeated prime factors without writing every copy. It is shorter, but it also carries more structure.

In number theory, exponents reveal useful information about divisors. For example, if n = 2³ × 5², then any positive divisor of n can use 2 zero, one, two, or three times, and 5 zero, one, or two times. The factorization carries a map of all divisors inside it.

What Happens When the Original Number Is Already Prime

If the number is prime, its prime factorization is the number itself. For example:

• 13 has prime factorization 13.
• 47 has prime factorization 47.
• 101 has prime factorization 101.

This can feel too simple, but it fits the rule. A prime number already has the smallest possible prime structure. It cannot be split into smaller positive prime factors.

So, not every factorization produces a long list. Sometimes the list has one item.

What Happens With 1, 0, and Negative Numbers

Most elementary prime factorization discussions focus on positive integers greater than 1. That choice keeps the idea clean.

• 1: not prime, not composite, and has no prime factorization in the usual positive-integer sense.
• 0: divisible by many numbers, so it does not have a standard prime factorization.
• Negative integers: can be written with a negative sign and the prime factorization of their absolute value, such as -60 = -1 × 2² × 3 × 5.

The usual question “find the prime factors of a number” normally means a positive whole number greater than 1. In that setting, the answer is unique and clear.

Worked Examples With Different Number Types

Example: A Small Composite Number

For 48, the prime factorization is easy to build through repeated division:

48 ÷ 2 = 24
24 ÷ 2 = 12
12 ÷ 2 = 6
6 ÷ 2 = 3
3 ÷ 3 = 1

So 48 = 2⁴ × 3. The prime factor 2 appears four times.

Example: A Number With Several Different Prime Factors

For 630, the factorization spreads across several primes:

• 630 is divisible by 2: 630 ÷ 2 = 315.
• 315 is divisible by 3: 315 ÷ 3 = 105.
• 105 is divisible by 3: 105 ÷ 3 = 35.
• 35 is divisible by 5: 35 ÷ 5 = 7.
• 7 is prime.

So 630 = 2 × 3² × 5 × 7.

Example: A Number With a Larger Prime Left Over

For 154, the number is even, so 2 appears first. Then 154 ÷ 2 = 77. Since 77 = 7 × 11, the full factorization is:

154 = 2 × 7 × 11

The leftover quotient may be prime, or it may still need splitting. That last check matters.

Example: A Square of a Prime

For 169, the square root is 13, and 169 = 13 × 13. So:

169 = 13²

Prime squares are useful examples because they show why the square-root boundary includes equality. If a number equals p², the prime p sits exactly at the square root.

How Prime Factors Connect to Divisors, GCD, and LCM

Prime factorization does more than answer one arithmetic question. It links directly to divisors, greatest common divisors, and least common multiples.

Divisors

Once a number has been written in prime-exponent form, its divisors can be understood by choosing allowable exponent values.

For 72 = 2³ × 3², a divisor may use:

• 2⁰, 2¹, 2², or 2³
• 3⁰, 3¹, or 3²

That is why 8, 9, 12, 18, 24, and 36 all divide 72. Each one uses no more prime power than 72 contains.

Greatest Common Divisor

The greatest common divisor uses the prime powers shared by two numbers. For example:

• 84 = 2² × 3 × 7
• 126 = 2 × 3² × 7

The shared prime powers are 2, 3, and 7. Therefore, gcd(84, 126) = 42.

Least Common Multiple

The least common multiple uses the largest prime powers needed to cover both numbers.

From the same pair, 84 and 126, the largest powers are 2², 3², and 7. So:

lcm(84, 126) = 2² × 3² × 7 = 252

Seen this way, GCD and LCM are not separate tricks. They are two different readings of prime factorization.

Common Mistakes When Finding Prime Factors

Most errors come from stopping too early or mixing ordinary factors with prime factors. The arithmetic may look right at first glance, but the final form is not prime yet.

• Leaving a composite factor: writing 60 = 6 × 10 is a factorization, not a prime factorization.
• Dropping repeated primes: 72 has prime factors 2 and 3, but its full factorization is 2³ × 3².
• Including 1: 1 is not a prime factor.
• Stopping before the quotient is prime: if a leftover number is composite, it still needs to be split.
• Forgetting the square-root boundary: when testing divisors, primes up to the square root are enough for deciding whether the remaining number is prime.

A correct final answer contains only prime numbers. Nothing composite should remain.

How Algorithms Find Prime Factors

For small and medium-sized numbers, trial division is enough. It tests possible prime divisors, divides when possible, and stops when the remaining quotient becomes 1 or a prime larger than the current testing boundary.

Computers can do this quickly for ordinary values. Large integers are a different matter. When numbers have hundreds of digits, prime factorization becomes far harder than multiplication. Multiplying two large primes is easy for a computer; recovering those primes from their product can be slow with basic methods.

This difference explains why prime factorization appears in modern mathematics and computer science. It connects to integer arithmetic, modular arithmetic, primality testing, and cryptographic systems that use large composite numbers.

Trial Division and Sieves

Trial division works one number at a time. A sieve, such as the Sieve of Eratosthenes, produces many primes within a range. When many factorizations are needed, a list of primes from a sieve can make later division checks cleaner.

The ideas are related but not identical:

• Trial division tests candidate divisors for one target number.
• A prime sieve marks primes across a whole interval.
• Prime factorization uses prime divisors to rebuild one number as a product.

For learning, trial division shows the logic most clearly. For repeated computation, sieves save work.

Why the Order of Prime Factors Does Not Matter

Multiplication is commutative, so 2 × 3 × 5 and 5 × 2 × 3 produce the same number. Because of that, prime factorizations usually appear in ascending prime order.

For example, write 300 = 2² × 3 × 5², not 5 × 2 × 5 × 3 × 2. Both multiply to 300, but the ordered exponent form is easier to read, compare, and reuse.

Ascending order also helps when comparing two numbers. You can line up the same primes and see shared or missing factors without hunting through a scrambled product.

How Prime Factors Fit Into Number Theory

Prime factors sit near the center of elementary number theory. They connect natural numbers to divisibility, congruences, modular arithmetic, divisor functions, perfect numbers, coprime pairs, and prime distribution.

A few related ideas help place prime factorization in context:

• Coprime numbers: two numbers are coprime when they share no prime factor. For example, 35 and 18 are coprime.
• Squarefree numbers: a number is squarefree when no prime factor repeats. For example, 30 = 2 × 3 × 5.
• Prime powers: numbers such as 8 = 2³ or 81 = 3⁴ contain only one distinct prime factor.
• Semiprimes: numbers made from two prime factors, counted with repetition. For example, 21 = 3 × 7 and 49 = 7².

These terms come from reading the prime factorization carefully. One line of prime powers can say a lot.

Prime Factorization and a Wider Explanation

The method of finding prime factors is part of the broader idea of prime factorization, where a number is represented as a product of prime numbers in its exact multiplicative form. That wider topic also explains why exponent notation, unique factorization, and divisor patterns belong together.

For the narrow question “how do you find the prime factors?”, the answer starts with exact division. For the deeper question “why does this always work?”, the answer is the uniqueness of prime factorization.

FAQ About Finding Prime Factors

What Is the Easiest Way to Find Prime Factors?

For ordinary numbers, the easiest method is usually repeated division by small primes: 2, 3, 5, 7, 11, and so on. When a prime divides the number exactly, it becomes part of the prime factorization.

Are Prime Factors the Same as All Factors?

No. All factors include every positive divisor of a number. Prime factors include only the divisors that are prime. For 12, all positive factors are 1, 2, 3, 4, 6, and 12. The prime factors are 2 and 3.

Can a Number Have the Same Prime Factor More Than Once?

Yes. Repeated prime factors appear when a prime divides the number more than once. For example, 40 = 2 × 2 × 2 × 5, or 2³ × 5.

Why Is 1 Not Used as a Prime Factor?

1 is not prime because it does not have exactly two positive divisors. If 1 were allowed in prime factorizations, the same number could be written with unlimited extra 1s, and uniqueness would fail.

How Do You Know When to Stop Dividing?

The division process stops when the remaining number is 1, or when the remaining number is prime. In a divisor test, checking primes up to the square root is enough because any larger factor would pair with a smaller one already checked.

What Are the Prime Factors of a Prime Number?

A prime number has itself as its prime factorization. For example, the prime factorization of 29 is simply 29.