Prime Factorization Calculator
Break a whole number into its prime factors and see the factorization in expanded form, exponent form, factor pairs, and calculation steps.
Results
The Prime Factorization Calculator expresses a positive integer greater than 1 as a product of prime numbers. Apart from ordering, that prime product is unique, which makes it useful for fractions, divisibility, GCF, LCM, and number theory.
A factor tree can branch in different ways
Trial division begins with 2 and continues through possible prime divisors. Each successful divisor is recorded and division repeats until the quotient is 1. Repeated factors are compactly written with exponents.
Every integer greater than 1 can be written uniquely as a product of prime numbers, apart from factor order.
Enter the values in their mathematical roles
Enter one positive whole number. Review both the expanded factors and exponential form. For a manual check, divide by small primes in order and stop testing new divisors once their square exceeds the remaining quotient.
The governing relationship
Every integer greater than 1 can be written uniquely as a product of prime numbers, apart from factor order.
A compact example
84 = 2² × 3 × 7.
Valid inputs and boundary cases
The number 1 is neither prime nor composite and has no prime factorization. Zero does not have a finite prime factorization, and negative integers require a separate factor of −1 before factoring the positive magnitude.
Read the answer in context
One is neither prime nor composite, and negative integers require a separate factor of −1.
An independent check
Multiply every reported prime power. The product must equal the original integer, and each listed base must itself be prime. Divisibility tests for 2, 3, 5, and 11 can speed a manual review.
Errors that change the answer
- Treating 1 as a prime factor
- Stopping while a composite quotient remains
- Listing a composite number as prime
- Losing repeated factors
- Trying to factor zero into finitely many primes
Continue with a related calculator
Continue with the LCM Calculator or Rounding Calculator. For everyday arithmetic and order-of-operations checks, use the Basic Calculator.
What this numerical result cannot decide
Straightforward trial division is fine for ordinary educational integers but very large factorization problems can be computationally difficult. The tool is not intended for cryptographic key analysis.
A second way to understand the method
For 360, one tree might begin 36×10 while another begins 8×45. Continuing until every leaf is prime gives the same collection: 2³×3²×5. Different valid branches do not change the unique prime factorization.
Divisibility tests make trial division faster
An even number is divisible by 2; a digit sum divisible by 3 indicates divisibility by 3; a final digit of 0 or 5 indicates divisibility by 5. Apply these tests repeatedly to the changing quotient. Once the remaining quotient is prime, it becomes the final factor.
Prime factors organize many other calculations
Fractions reduce by cancelling shared prime factors. A GCF uses the lowest shared exponents, while an LCM uses the highest exponents appearing anywhere. Perfect squares have even exponents in their prime factorizations, so factorization can also show immediately whether an integer has a whole-number square root.
Perfect powers in prime notation
An integer is a perfect square when every prime exponent is even. It is a perfect cube when every exponent is divisible by three. For 216=2³×3³, both exponents are multiples of three, so 216=6³. This provides a direct check without testing many candidate roots.
From factorization to divisor count
If n=pᵃqᵇ, the number of positive divisors is (a+1)(b+1). Each divisor chooses an exponent from zero through the maximum for every prime. This useful consequence depends on a complete prime factorization.
Prime Factorization Calculator FAQ
Is 97 prime?
Yes; no prime at or below √97 divides it.
What is the factorization of 1?
It has no prime factorization and is called a unit.
Why are exponents used?
They show repeated multiplication compactly, such as 2×2×2=2³.
For additional worked mathematics, see the free OpenStax Prealgebra 2e reference.
