Prime Factorization Calculator

Prime Factorization Calculator

Factors one integer from 2 through 1000000000000 inclusive into prime factors. Default input is 10. Empty input, multiple values, noninteger values, negative numbers, 0, 1 and values above the limit are rejected.

Uses trial division starting at 2: repeatedly divide while divisible, then advance the trial factor until its square exceeds the remaining quotient. Any remaining value above one is appended. Output repeats factors using multiplication signs instead of exponent notation.

Verified 360 gives 360 = 2 × 2 × 2 × 3 × 3 × 5; prime 97 gives 97 = 97. Product of returned factors equals the input. All accepted values are below JavaScript's safe integer ceiling, so this range does not require BigInt input. It is not arbitrary-size cryptographic factorization.

The bound limits trial-division work, but large primes take more iterations than easily divisible numbers; the calculation runs on the page thread, not an asynchronous progress worker. Completion time varies with the number and device. There is no algorithm, precision, exponent-format or batch selector.

Enter one integer from 2 to 1000000000000. Ungrouped digits such as 1000 are recommended. Valid local grouping, a decimal notation with an integer value, and scientific notation such as 1e2 are accepted. Mixed text, malformed grouping and noninteger values are rejected.