CalculatorMath

GCD and LCM Calculator

Find the greatest common divisor and least common multiple of two integers. For 12 and 18, GCD is 6 and LCM is 36.

Instant · no account

Input

Enter your values

First integer

Second integer

Method

How it works

Change any input above and the result updates instantly. The formula or method used by this tool is shown below.

LCM = |a × (b / GCD)|; Euclid’s algorithm finds GCD.

Keep going

Related tools

Explore more tools from Math and similar workflows.

Annulus Area Calculator→Circle Area and Circumference Calculator→Combinations Calculator→Cone Volume Calculator→Cylinder Volume and Surface Area Calculator→Factorial Calculator→Mean Absolute Deviation Calculator→P-Value Calculator→

Quick answers

About this tool

What does the GCD and LCM Calculator do?+

Find the greatest common divisor and least common multiple of two integers. For 12 and 18, GCD is 6 and LCM is 36.

How does this calculator calculate the result?+

It uses this method: LCM = |a × (b / GCD)|; Euclid’s algorithm finds GCD.

Are my inputs saved or sent to an account?+

Core CalcWorkspace tools require no account, and most calculations run locally in your browser. Favorites and recent-tool history, when used, stay in this browser.