InstantTools.siteZero Latency Utilities
calc Tool
100% In-Memory (Zero Server Upload)

Prime Factorization & GCD/LCM

Break whole numbers into prime factors, then find the greatest common divisor and lowest common multiple across a whole list.

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.

About Prime Factorization & GCD/LCM

Take a list of integers and get the prime factorisation of each, with multiplicities spelled out and a plain multiplier string so it can be checked at a glance. The tool also reports whether each number is prime, whether it is a perfect square or a perfect power, and how many divisors it has, then reduces the whole list to a greatest common divisor and a lowest common multiple. Non-integer or negative entries are rejected with a message naming the exact entry that failed.

Key Features & Privacy Guarantee

  • Zero server transmission: all computation happens instantly in your local browser runtime.
  • No sign-up, no subscriptions, and no usage quotas.
  • Optimized for maximum speed, accuracy, and lightweight performance.
  • Instant one-click clipboard copying.

Frequently Asked Questions

Common questions and helpful answers about this utility.

It underpins a lot of number theory, and it is how fractions get reduced to their lowest terms and how you find out whether two numbers share any factor at all.