Rangdom

Enter a positive integer (up to 1000000000000) above to see its prime factors.

Break a positive integer into its prime factors

Type a single positive integer and the panel reports its exponent form (e.g. 360 = 2^3 × 3^2 × 5), its expanded form (2 × 2 × 2 × 3 × 3 × 5), the number of distinct primes, and the total number of prime factors counted with multiplicity — all updating live as you type. The copy button copies the exponent form. 1 has no prime factors, and a prime number is flagged as its own only factor.

Factoring uses BigInt trial division: it divides out every factor of 2, then tests odd divisors up to the square root, and any remainder greater than 1 left at the end is the final prime factor. Inputs are capped at 1000000000000 (10^12) so the calculation stays responsive. If the input is not a whole number, is less than 1, or exceeds the cap, an inline message names the problem instead of rendering NaN. Everything is computed in your browser with no network calls. Pollard’s-rho and other heavy factoring of huge semiprimes, decimals, fractions, and negative numbers are out of scope.