Prime Factorization Calculator
Decompose an integer into a product of prime factors using bounded trial division. Negative values retain a factor of −1, making the displayed product reproduce the original input.
- Explicit formulas and worked examples
- Check your inputs, then calculate
- Data is calculated in this browser only
Check the stated input format, calculation convention and limits before using the result.
Check the example inputs, then calculate. Your values stay in this browser.
Zero and ±1 have no prime-factor decomposition in this display.
Understand the Prime Factorization Calculator
Choose the right record before calculating
Enter a whole number with absolute magnitude from two through the stated interactive bound. Negative inputs retain a −1 factor. Zero and ±1 are excluded from this prime-product display. The tool explains factorization, not cryptographic attack feasibility or the cost of factoring arbitrary huge integers.
Content and calculation reviewed:
Understand the calculation
How to use it and the math behind it
Four steps to check your inputs and results
- Decompose an integer into a product of prime factors using bounded trial division. Negative values retain a factor of −1, making the displayed product reproduce the original input.
- Enter Integer (absolute value 2 to 10¹²) in the stated format. Baseline values are for reproduction.
- Check the output unit and convention: Read prime factors with its stated unit and convention. The default example and the independent worked scenario use different inputs, so compare the assumptions before comparing the numbers.
- Change one input and compare the result. Zero and ±1 have no prime-factor decomposition in this display. Absolute values above 10¹² are excluded to bound interactive calculation time.
Prime Factorization Calculator: calculation relationships
Divide by a prime repeatedly before moving to the next candidate. For 84, two divisions by 2 leave 21, then 3 and 7 complete 2×2×3×7. Testing beyond the square root of the remaining value is unnecessary: any composite remainder would already have a smaller factor. Multiplying the displayed factors independently is a useful check.
n = p₁ × p₂ × … × pₖ
The detailed guide adds variable definitions, a reproducible example, a practice question and model limitations.
Questions before you calculate
Is −1 a prime factor?
No. It preserves the input sign; the remaining positive factors are prime.
Why are zero and one excluded?
They do not have the finite prime-product representation used for integers greater than one.
What does an exponent on a factor mean?
It records how many times that prime appears in the product.
How can I verify the answer?
Multiply every prime power and the retained sign to recover the original integer.
Does the bound restrict mathematics?
No. It limits interactive runtime, not the general factorization theorem.
From question to result