Mathematics & calculation

GCF / GCD and LCM Calculator with Steps

Find the greatest common factor (greatest common divisor) and the least common multiple of 2 to 20 integers, with Euclid’s successive divisions and prime factorizations.

Local processing · Fits its container · Updated without touching your code

Configure widget Use the full tool

Embed this widget

Customize the result, check the live preview, then copy the code.

Preview

Embed code type

Responsive and automatically resized by Bethemesh.

Code to copy

<div
  class="bethemesh-widget"
  data-tool="gcd-lcm-calculator"
  data-lang="en"
  data-theme="auto"
  data-min-height="620"
  data-max-height="1300"
  data-sandbox="allow-scripts allow-same-origin"
  data-allow="clipboard-write"
></div>
<script src="https://bethemesh.com/widgets/v1/bethemesh.js" async></script>
<p style="margin:6px 0 0;font:12px/1.4 system-ui,sans-serif">Free tool by <a href="https://bethemesh.com/en/tools/gcd-lcm-calculator">Bethemesh</a></p>

The documentation details the options, themes, sizes and the integration in each CMS. The code works in an HTML page, WordPress, Webflow, Wix, React, Vue or Astro.

Documentation All widgets

Workspace

Personal

Preferences

Contribute

About

GCF / GCD and LCM Calculator with Steps

Embed this widget

Preview

Embed code type

Code to copy

Need help with the integration?