How does the tool find the prime factors?

It uses trial division: starting at 2, it repeatedly divides the number by the smallest divisor it can find, counting how many times each prime divides evenly before moving to the next candidate. It checks 2 first, then only odd numbers after that, stopping once the candidate's square exceeds what's left of the number, at which point anything still remaining is itself a prime factor.

Why does the output sometimes show an exponent, like "2^3"?

When a prime factor divides the number more than once, it's written with a "^" and the count, so "2^3" means the prime 2 appears three times in the factorization (i.e. it contributes a factor of 8). Primes that appear only once are written without an exponent.

What does the fundamental theorem of arithmetic have to do with this?

It's the theorem guaranteeing that every integer greater than 1 has exactly one prime factorization, up to the order the factors are listed in. That's why this tool's output is the unique correct answer, not just one of several valid ways to factor the number.

What's the largest number I can factor?

Input is capped at 10^15 (one quadrillion). Trial division on a large prime near that cap can take a few seconds in the browser since it has to scan candidates all the way up to the number's square root before concluding it's prime.

Prime Factorization Calculator - Find Prime Factors Online

Overview

Introduction

Every integer greater than 1 breaks down into a unique product of prime numbers, and finding that breakdown by hand for anything but a small number quickly becomes trial-and-error.

This tool runs the trial-division search for you and returns the exact prime factorization, written compactly with exponents for repeated primes.

What Is Find Prime Factors?

A calculator that decomposes an integer greater than 1 into its prime factors, formatted as a product like "2^3 x 3 x 5" where each prime appears with its exponent (omitted when the exponent is 1).

It's the factorization companion to Number Divisor Finder, which instead lists every divisor of a number rather than just its prime building blocks.

How Find Prime Factors Works

The tool validates that the input is a whole integer greater than 1, then converts it to a BigInt so factoring stays exact for large inputs.

It trial-divides by 2 first, then by every odd candidate from 3 upward, dividing out each prime as many times as it evenly divides and recording that count as its exponent.

The scan stops once a candidate's square exceeds what remains of the number; if anything greater than 1 is still left at that point, it's itself a prime factor and gets appended with an exponent of 1.

When To Use Find Prime Factors

Use it whenever you need a number's exact prime factorization, for simplifying a fraction, computing a GCD or LCM by hand, or checking a factoring homework problem.

For the complete list of every divisor rather than just the prime building blocks, use Number Divisor Finder; for a straightforward yes/no primality answer, use Prime Number Checker.

Often used alongside Find All Divisors of a Number and Test If a Number Is a Prime.

Features

Advantages

Returns the exact, uniquely correct factorization guaranteed by the fundamental theorem of arithmetic.
Uses BigInt arithmetic throughout, so results stay exact right up to the 10^15 input cap.

Limitations

Input is capped at 10^15; factoring a large prime near that cap can take a few seconds since trial division must scan all the way to its square root.
Only accepts integers greater than 1; factorization is undefined for 0 and 1.

Examples

Factoring 40

Input

Output

2^3 x 5

40 = 2×2×2×5, so the prime 2 contributes an exponent of 3 and the prime 5 contributes an exponent of 1 (shown without a "^").

Best Practices & Notes

Best Practices

If the input is itself a large prime, expect the calculation to take noticeably longer, since trial division only concludes there's no smaller factor after scanning candidates all the way to the square root.

Developer Notes

The trial-division loop advances its candidate divisor by 1 after checking 2, then by 2 for every step after that, so only odd candidates are tried once 2 has been ruled out or exhausted. The loop's bound `divisor * divisor <= remaining` uses the shrinking `remaining` value (the input with already-found factors divided out) rather than the original input, which keeps the scan proportional to the largest remaining prime factor instead of the original number's full square root.

Find Prime Factors Use Cases

Simplifying a fraction or computing a GCD/LCM by hand and needing the prime factorization as a starting point
Checking a prime factorization homework problem against a verified answer
Verifying a factorization function in your own code against a known-good reference result

Common Mistakes

Reading "2^3 x 5" as "2 times 3 times 5"; the "^3" is an exponent on the 2, not a separate factor, so this notation means 2×2×2×5, not 2×3×5.

Tips

Multiply the listed factors back together (respecting the exponents) to double-check the result matches your original input.

Find Prime Factors