Prime Factorization
Factor an integer of up to 15 digits by trial division.
About this tool
Trial division pulls out 2 and then odd divisors until the remainder is 1 or itself prime. The list is the factors with repetition, so 12 is 2 × 2 × 3.
This is exact for the size limit. It is not a general factoring service for cryptographic integers.
How to use it
- Enter an integer greater than 1.
- Calculate.
- Read the prime factors. A value longer than 15 digits is rejected.
Limitations
- The limit is 15 digits. Longer integers are refused rather than run a long trial.
- 1 and non-integers are rejected. The factors are the prime product of the value you entered.
Trial division up to fifteen digits
What gets multiplied back together
The input is one integer. It must be greater than 1, and it must have at most fifteen digits, which means it must be at most 10^15. The algorithm pulls out factors of 2, then tests odd divisors from 3 upward while the square of the divisor does not exceed what remains. Each factor is recorded as it is divided out, so repeated primes appear repeatedly. The panel joins them with multiplication signs. A prime input is printed as itself, because the leftover cofactor is that prime.
Three hundred sixty
360 is even, so 2 is recorded three times: 360 → 180 → 90 → 45. Then 3 divides 45, leaving 15, and 3 divides 15, leaving 5. The square of the next odd candidate exceeds 5, so 5 is appended. The panel reads 2 × 2 × 2 × 3 × 3 × 5. Multiply those six primes and you return to 360. A second check: 17 prints as 17.
Edges that stop the loop
1, 0, and every negative integer are refused with a request for an integer greater than 1. An integer with sixteen digits is refused even if it is easy to factor by hand. Decimals are refused because the box wants a whole number. The list is not written in exponent form such as 2^3 × 3^2 × 5. Order is ascending primes, with repeats inline. There is no primality certificate separate from the factor list. A prime and a composite are distinguished only by whether the printed product has one term or several.
Why fifteen digits is the cutoff
The trial loop is simple division, not a factored database. Past 10^15 the page stops rather than risking a long run in the browser on a hard composite. Numbers well under that cap, including a prime near the cap, still finish by testing odd candidates up to the square root of whatever remains. A power of two such as 256 prints eight twos. You can multiply the printed primes to audit the line. The multiplication signs are the only separators. Exponents are not collected, so 2 × 2 × 2 × 2 × 2 × 2 × 2 × 2 is the honest output for 256, not 2^8.
Privacy
Your input is processed in your browser and is not uploaded to UtilChain. File names, text, and results are not sent to analytics.

