# GCD & LCM Calculator Find the greatest common divisor and least common multiple of any list of whole numbers — with big-integer precision, entirely in your browser. The largest number dividing all of them is 6. ### How it works The greatest common divisor is found with the **Euclidean algorithm** — repeatedly replacing the larger number by its remainder against the smaller until one becomes zero — applied across the whole list. The least common multiple of each pair is their product divided by their GCD, carried through the list. All values are held as `BigInt`, so even very large numbers stay exact. If the GCD is 1, the numbers are flagged as coprime. --- *Source: [ocxly.com/gcd-lcm.html](https://ocxly.com/gcd-lcm.html) — OCXLY, free 100% client-side privacy-first tools. Free GCD and LCM calculator. Find the greatest common divisor and least common multiple of any list of whole numbers with big-integer precision, entirely in your browser.*