Prime Factorization
Enter a decimal integer to check whether it is prime or composite and verify its factor product.
A QUICK WALKTHROUGH
How to use this tool
- Enter an integer from 2 to 9007199254740991.
- Choose Factorize; cancel or edit the input to stop an active calculation.
- Review the classification, powers, expanded factors, product check, and optional tree.
Prime powers and expanded factors
Equal primes are grouped into powers. The expanded form repeats each prime factor; their exact BigInt product is checked against the input.
Bounded local computation
Deterministic Miller–Rabin identifies primes within the input range. Bounded Pollard rho splits composites. Work yields to the browser and stops after 2,000,000 counted arithmetic steps, 10 seconds, or 32 unsuccessful split attempts; difficult inputs can exhaust the budget. No partial factorization is displayed.
Exact input and privacy
Use plain decimal digits with no sign, decimal point, or exponent. Leading zeros are normalized. All arithmetic and the optional text tree stay in this browser.
GOOD TO KNOW
Common questions
Can a valid input fail?
Yes. A hard composite or slow device may exhaust the operation or time budget. Retry if desired; success is not guaranteed.
Does editing cancel the result?
Yes. Editing the input cancels active work and hides the previous result. Cancel also stops work.
Are numbers rounded?
No. Decimal input is parsed directly as BigInt and every factor product is verified exactly.