What prime factorization means
A prime factorization writes an integer greater than one as a product of primes. For example, 60=2²×3×5. The fundamental theorem of arithmetic says this prime multiset is unique apart from order, which makes prime factorization a dependable representation for divisibility work.
A factorization is incomplete if any factor is composite. Writing 60=6×10 is valid multiplication but not prime factorization. Continue until every factor is prime, then collect repeated primes with exponents.
Prime factors are different from all factors. The positive factors of 12 are 1, 2, 3, 4, 6, and 12, while its prime factorization is 2²×3. The list of divisors describes every whole-number divisor; prime factorization records the irreducible multiplication building blocks. Confusing these outputs leads to claims such as 4 being a prime factor even though 4 is composite.
Repeated division method
Start with the smallest prime, usually 2. Divide while the quotient remains whole, record each prime, then try the next prime. Stop when the remaining quotient is one. If the remaining quotient is prime, record it directly.
Divisibility tests reduce trial work: even numbers divide by 2; digit sums divisible by 3 indicate divisibility by 3; endings 0 or 5 indicate divisibility by 5. After small primes, test candidates only through the square root of the remaining value.
After dividing out a prime, restart testing from that prime because it may repeat. For 40, division by 2 produces 20, then 10, then 5; moving immediately to 3 after the first division would miss two copies of 2. Exponents compactly record this repetition.
Systematic trial division is more reliable than guessing factor pairs. Test 2, then 3, then 5, and then larger primes as needed, dividing out every occurrence before advancing. Composite trial divisors are unnecessary because any composite divisor contains a smaller prime divisor that would already have been found. This observation reduces work and supports the square-root stopping rule.
Three complete factorizations
Input: 84. Formula: repeatedly divide by prime factors. Calculation: 84÷2=42; 42÷2=21; 21÷3=7; 7÷7=1. Result: 84=2²×3×7. Interpretation: multiplying 4×3×7 returns 84, and every listed factor is prime.
Input: 360. Formula: divide by the smallest available prime. Calculation: 360÷2=180; ÷2=90; ÷2=45; ÷3=15; ÷3=5; ÷5=1. Result: 360=2³×3²×5. Interpretation: exponents count repeated occurrences.
Input: 97. Formula: test prime divisors through √97≈9.85. Calculation: 97 is not divisible by 2, 3, 5, or 7. Result: the prime factorization is 97 itself. Interpretation: a prime number has exactly one prime factor in its factorization, with exponent one.
Input: 1,001. Formula: test prime divisors and continue on quotients. Calculation: 1,001÷7=143; 143÷11=13; 13÷13=1. Result: 1,001=7×11×13. Interpretation: divisibility is not always obvious from the last digit, so systematic testing matters.
Use multiplication as an exact checksum, not merely a mental estimate. For 1,001=7×11×13, multiply 7×11=77 and 77×13=1,001. Also confirm that 7, 11, and 13 are prime. A product matching the input is necessary, but a representation such as 7×143 is still incomplete because 143 is composite. Both reconstruction and primality of every base are required.
Factor trees reach the same result
A factor tree begins with any convenient factor pair and continues splitting composite branches. For 72, one path is 8×9, then 8=2×2×2 and 9=3×3, yielding 2³×3². Another path such as 6×12 ends with the same primes.
Different layouts do not mean different answers. Sort prime leaves and multiply them back. If two completed trees appear to disagree, at least one contains a composite leaf, missed factor, or arithmetic error.
A factor tree is complete only when every leaf passes a primality check. If a branch ends at 21, split it into 3×7; if it ends at 49, split it into 7×7. Labeling leaves and then sorting them prevents omissions when branches have different depths. Reconstructing the original number from the leaves catches both missed factors and accidental duplication.
One, zero, and negative integers
The number 1 is neither prime nor composite and has an empty prime factorization. Zero has no finite prime factorization because every nonzero integer divides it and no finite prime product equals zero.
For a negative integer, factor its absolute value and include −1 when signed factorization is relevant: −60=−1×2²×3×5. Elementary calculators may accept only positive integers, so check the documented input domain.
The empty product for 1 equals 1, which keeps multiplication rules consistent, but it does not make 1 prime. A prime has exactly two positive divisors, 1 and itself; the number 1 has only one. Keeping these definitions separate prevents errors in factor counts and uniqueness statements.
Negative signs and prime factors play different roles. In integer arithmetic, −1 is a unit rather than a prime, so it is written separately when factoring a negative number. The positive prime powers describe the magnitude. Restrictions vary by educational context and software, so state whether the task asks for a positive integer's prime factorization or a signed integer factorization.
How to verify and use the factors
Multiply the prime powers to reconstruct the original number. Confirm each base is prime and exponents are positive integers. The product should match exactly, with no rounding. A missed copy of a prime changes the result and later GCF or LCM calculations.
Prime factorization supports fraction simplification, divisor counts, perfect-square tests, GCF, LCM, and divisibility reasoning. It does not by itself solve every number-theory problem, and complete factorization of very large integers can be computationally difficult.
If n=p₁^a₁…pₖ^aₖ, its positive divisor count is (a₁+1)…(aₖ+1). For 360=2³×3²×5, the count is 4×3×2=24. This application works because each divisor independently chooses an exponent from zero through the exponent available in n.
Prime powers also reveal perfect powers. A positive integer is a perfect square exactly when every exponent in its prime factorization is even; it is a perfect cube when every exponent is divisible by three. Thus 360=2³×3²×5 is neither, while 144=2⁴×3² is a square. This test depends on a complete, correct factorization, which is why verification comes before application.
Using the Prime Number Checker
Use the Prime Number Checker to determine whether a candidate factor is prime. For composite inputs, perform repeated division or a factor tree separately, verifying each final factor with the checker when needed.
The tool’s primality result does not automatically produce a full factorization. Stay within its supported integer range, preserve exact integer input, and do not interpret a timeout or invalid input as evidence that a number is prime.
For large inputs, a primality checker can confirm whether the current quotient may be recorded, but it cannot recover factors already skipped through incorrect division. Maintain an exact division log: divisor, quotient, and remainder. Accept a factor only when the remainder is zero. Decimal approximations have no role because prime factorization is an exact statement about integers.