Whole numbers
Up to 60 positive whole numbers, each at most 1,000,000,000,000. Zero, negatives, decimals and anything above the limit are reported back one by one so you can fix the exact token that failed.
Formula
n = p₁^e₁ · p₂^e₂ · … · divisors = ∏(eᵢ + 1)
gcd(a, b) via Euclid · lcm(a, b) = |a·b| ÷ gcd(a, b)
Factorization
Enter one or more positive whole numbers. For each you get the prime factorization, whether it is prime, a perfect square or a perfect power, how many positive divisors it has, and how many digits it is — plus the GCD and LCM of the whole list.
How the numbers are worked out
trial division up to √n · n = ∏ pᵢ^eᵢ · divisors = ∏(eᵢ + 1) · gcd by Euclid · lcm = |a·b| ÷ gcd
Every candidate divisor is tried in turn and divided out repeatedly, so whatever is left after the loop has no factor up to its own square root and must be prime. The divisor count multiplies the choices you have for each prime power: a number written as 2⁴·3² has (4+1)·(2+1) = 15 divisors. Perfect squares and perfect powers are checked with exact integer roots, so no floating-point guesswork is involved, and the GCD and LCM run through BigInt arithmetic so they stay exact no matter how large the results get.
Inputs are capped at 1,000,000,000,000 so trial division stays instant. Everything runs in this tab and nothing is saved.