Prime factorization

Factor a bounded integer into ordered prime factors and their exponents, retaining the sign of a negative input.

A nonzero integer with absolute value at most 1,000,000,000,000; up to 13 digits excluding the sign, including leading zeroes.

Accepts digits 0–9, Arabic-Indic ٠–٩ and extended Arabic-Indic ۰–۹, with an optional +, - or − sign. No spaces, decimals, separators or expressions.

Local BigInt arithmetic; one worker, a 5-second deadline and at most 128 KiB of output. No automatic storage or requests carrying your input.

How to use

Enter the integer and calculate. Read its positive prime factors in ascending order with each exponent. Negative input adds a leading sign factor −1. Copy or download the TXT report; the input is not automatically rewritten.

Try an example

-360 = −1 × 2^3 × 3^2 × 5. The prime 97 produces 97 = 97. Neither 1 nor −1 is prime, and neither has prime factors.

Support & limits

The engine tries division by 2, then odd candidates up to the square root of the remainder, using BigInt within 10^12. Zero is rejected. Whitespace, separators, fractions, base prefixes and scientific notation are unsupported. Digits may be 0–9, Arabic-Indic or extended Arabic-Indic, with a +, - or − sign. The sign factor −1 is not prime. This is a bounded educational tool, not a large cryptographic integer factorizer.

Common questions

Does a timeout mean the number is prime?

No. A timeout stops the worker and reports an error without a partial factorization or primality claim. Try a smaller integer. You can cancel and calculate again while keeping the inputs in their fields.

Related tools