LCM and GCD Calculator
Enter two or more whole numbers separated by commas to find their LCM and GCD instantly.
GCD
6
LCM
180
How it is calculated
The GCD is found using the Euclidean algorithm, repeatedly taking remainders until they reach zero. The LCM is then derived from the GCD using the relationship LCM(a, b) = |a × b| / GCD(a, b), applied across the whole list of numbers.
Frequently asked questions
What is GCD used for?
The Greatest Common Divisor is used to simplify fractions to their lowest terms and to solve problems involving splitting quantities into equal groups.
What is LCM used for?
The Least Common Multiple is commonly used to add or subtract fractions with different denominators, and to solve problems about repeating events happening together.
How many numbers can I enter?
You can enter two or more numbers separated by commas; the calculator finds the GCD and LCM across the entire list.
Related tools
You might also need these while working on the same task.
Solve direct and inverse rule of three (cross-multiplication) problems instantly.
Open toolConvert numbers between binary, octal, decimal and hexadecimal instantly.
Open toolCalculate the simple or weighted average of your grades and check if you are passing.
Open toolCreate a Brazilian PIX copy-and-paste QR code in seconds.
Open tool