The HCF is the greatest whole number that divides both inputs. The LCM is the smallest positive whole number divisible by both.
Lcm Calculator
Enter your values below to get the result first, then scroll for the full explanation and guidance.
Lowest common multiple (LCM)
Lowest common multiple (LCM): 36 (Positive whole numbers)
The HCF is found with the Euclidean algorithm; dividing before multiplying gives the exact LCM.
Common factors and multiples
The HCF is found with the Euclidean algorithm; dividing before multiplying gives the exact LCM.
Result snapshot
A quick visual read of the values behind this result.
Recommended next checks
- →Use the HCF when simplifying a ratio or fraction, and the LCM when aligning repeating intervals.
- First integer
- 12
- Second integer
- 18
- Highest common factor (HCF)
- 6
Try different values to compare results.
Enter two positive whole numbers to calculate their exact lowest common multiple and highest common factor.
Lowest common multiple (LCM)
Lowest common multiple (LCM): 36 (Positive whole numbers)
The HCF is found with the Euclidean algorithm; dividing before multiplying gives the exact LCM.
Common factors and multiples
The HCF is found with the Euclidean algorithm; dividing before multiplying gives the exact LCM.
Result snapshot
A quick visual read of the values behind this result.
Recommended next checks
- →Use the HCF when simplifying a ratio or fraction, and the LCM when aligning repeating intervals.
- First integer
- 12
- Second integer
- 18
- Highest common factor (HCF)
- 6
Try different values to compare results.
Table of Contents
Table of Contents
About Lcm Calculator
Lcm Calculator helps you work through the main numbers for this topic quickly with a simple input flow and an instant result.
Use the calculator result as a practical starting point, then review the explanation and assumptions on the page if you want more context.
LCM and HCF method
The Euclidean algorithm repeatedly takes remainders to find the HCF. Dividing one input by the HCF before multiplying by the other gives the exact LCM without unnecessary overflow.
Formula explained
Calculation flow
This calculator is structured for fast UK-focused estimates with clear inputs, repeatable logic, and instant results.
Formula
Input values -> calculation engine -> instant result
How the result is built
Example
Example: 12 and 18 have HCF 6 and LCM 36.
Assumptions
- Both inputs are positive whole numbers no greater than 1,000,000,000.
- HCF is found by the Euclidean algorithm and LCM = first x second / HCF.
Source basis
- UK-focused calculator flow
- Structured input validation
- Instant result breakdowns
FAQ
Common questions
Trust and notes
Assumptions and important notes
This calculator is designed to give a fast estimate using the method shown on the page. Results are most useful when your inputs are accurate and the tool matches your situation.
Use the result as guidance rather than a final diagnosis or professional decision. If the result could affect health, legal, financial, or compliance decisions, verify it with a qualified source where appropriate.
- Both inputs are positive whole numbers no greater than 1,000,000,000.
- HCF is found by the Euclidean algorithm and LCM = first x second / HCF.
Method
UK calculator guidance
Last reviewed
April 17, 2026