✳tools.stBrowse tools
◈ Processed on your device
±

GCD and LCM

Find the greatest common divisor and exact least common multiple of integers.

Free

Enter two or more integers separated by commas or spaces. The tool applies the greatest-common-divisor algorithm repeatedly and builds the least common multiple with integer arithmetic, returning both as decimal strings.

◈ Local processingFree

How to use

  1. Enter your text, values, or image.
  2. Adjust the options and run the tool.
  3. Copy or download your result.

Worked example

Example input

Integers: 12,18,30

Example result

{
  "gcd": "6",
  "lcm": "180"
}

Limitations and details

Use 2–100 JavaScript-safe integers; any zero makes the LCM zero, and an all-zero list returns GCD zero.

Inputs and options

Integers
Text

Frequently asked questions

Is this tool free and private?

Yes. All 300 tools are free in this phase. Processing happens in your browser; your input and files are not sent to our servers.

Related tools