Break a whole number into the prime powers whose product reconstructs it. Each submitted value produces prime factorization plus the intermediate reasoning.
Every integer greater than 1 has one prime factorization, apart from the order of the factors. Prime numbers cannot be divided further into smaller positive integer factors other than 1 and themselves. For a connected concept in Prime Factorization, see build an LCM.
Reading prime factorization correctly starts with the mathematical structure described here.
Factorization exposes divisibility, makes roots easier to simplify, and supports GCF and LCM work. It is also the structural idea behind several topics in modular arithmetic and cryptography. A related application of Prime Factorization is build a GCF.
One is neither prime nor composite, so it does not have a prime factorization. A negative integer can be written with a factor of −1 followed by the factorization of its absolute value, but this tool accepts positive integers.
Reversing the displayed steps offers a quick independent check on this prime factorization result.
Repeated division turns 756 into 2 × 378, then 2 × 189, then 3 × 63, 3 × 21, 3 × 7, and finally 7. Grouped powers give 756 = 2² × 3³ × 7.
Try the smallest prime, 2, and divide for as long as the remainder is zero. Continue with 3, 5, 7, and later primes. Once the trial divisor exceeds the square root of what remains, that remainder is prime.
Start the prime factorization setup by pairing every source number with whole number. Convert unlike units before typing, and postpone rounding until the displayed prime factorization is ready to report.
Large prime inputs return immediately as a single factor, whereas composites built from two large primes require more trial divisions than numbers containing small factors. Use that direction of change to check the displayed prime factorization before copying it elsewhere.
When copying the result elsewhere, include its label and any squared, linear, angular, or percentage unit implied by the inputs. That record distinguishes a calculated prime factorization from an unlabeled number and makes later checking substantially easier.
A general factor list includes composite divisors; prime factorization uses only indivisible primes. The compressed prime-power form can reconstruct every positive factor without listing them all. Keep that boundary in mind when interpreting the numerical result.
For later verification, record whole number before rounding the prime factorization. The unrounded working value can feed subsequent steps while the rounded value serves presentation.
Yes, except that the factors may be written in a different order.
If a composite remainder had a factor larger than its square root, it would also need a smaller paired factor already tested.
No. Including 1 would destroy uniqueness because any number of extra ones could be inserted.
The answer is the input itself with exponent 1 left implicit.
Trial division in a browser needs a practical ceiling so an unusually hard input cannot stall the page.