Turn integers into a product of primes, one number per line, as many lines as you like.

How to use:
1. Enter one integer per line, e.g. 360;
2. Choose the output form (product + exponent, product only, exponent only);
3. Hit Run to get both forms together with the divisor count and divisor sum - copy it or export as CSV.

For example 360 = 2 x 2 x 2 x 3 x 3 x 5 = 2^3 x 3^2 x 5, with 24 divisors adding up to 1170.
The maths uses BigInt: primes below 1000 strip the small factors, then Miller-Rabin tests primality and Pollard rho splits what is left, so any composite up to 18 digits is factored quickly. Composites that are too long to split are skipped with a notice rather than reported wrongly.