Greatest common divisor (GCF) of 2 to 10 numbers by Euclid’s algorithm, plus the LCM
Runs in your browser. Nothing you type is sent anywhere. Checked against sources on 21 Nov 2026.Checked against the tool’s code on 18 November 2026. Figures read from their sources on 21 November 2026. What we collect
The greatest common divisor (GCD), also called the greatest common factor (GCF) or, in Indian schools, the HCF, is the largest whole number that divides every number in a list. Type 2 to 10 numbers and the calculator finds the GCD with Euclid’s algorithm, writing out each division. Nothing is uploaded.
Nothing is uploaded: this runs in your browser.
Type the numbers; 48, 180 is the example.
Divide the larger by the smaller and keep the remainder: 180 = 48 × 3 + 36.
Repeat with the divisor and the remainder until the remainder is 0: 48 = 36 × 1 + 12, 36 = 12 × 3 + 0.
The last divisor, 12, is the GCD; the calculator shows every line.
The calculator also checks the answer against the prime factorisations and gives the least common multiple.
Write each number as a product of prime powers. The HCF is the product of the smallest power of each prime that is common to all the numbers; the LCM is the product of the greatest power of every prime that appears. For 12 = 2² × 3, 18 = 2 × 3² and 30 = 2 × 3 × 5, the HCF is 2 × 3 = 6 and the LCM is 2² × 3² × 5 = 180. This is the method of the NCERT Class 10 chapter on real numbers, which rests on the Fundamental Theorem of Arithmetic: every whole number above 1 has exactly one prime factorisation.
For any two positive whole numbers a and b, HCF(a, b) × LCM(a, b) = a × b. For 6 and 20: 2 × 60 = 120 = 6 × 20. The calculator prints this check for two numbers. It does not hold for three or more numbers: for 12, 18 and 30, 6 × 180 = 1,080, not 6,480.
Euclid's algorithm finds the HCF without factorising: divide the larger number by the smaller, then divide the divisor by the remainder, and repeat until the remainder is 0; the last divisor is the HCF. For three or more numbers it is applied pair by pair. The division (ladder) method finds the LCM: divide the row by a prime that divides at least one number, bring the others down unchanged, and stop when every number is 1; the LCM is the product of the primes on the left. The calculator writes out both.
The rest of the article, and all 7 questions about LCM and HCF Calculator, With Prime Factorisation Steps, are on the LCM and HCF Calculator, With Prime Factorisation Steps page.
Type the three numbers, for example 12, 18, 30. The calculator factorises each one (2² × 3, 2 × 3², 2 × 3 × 5), takes the smallest power of each common prime for the HCF (2 × 3 = 6) and the greatest power of every prime for the LCM (2² × 3² × 5 = 180), and shows each step.
Yes. Highest common factor (HCF), greatest common divisor (GCD) and greatest common factor (GCF) are three names for the same number; Indian school books say HCF, most other countries GCD or GCF.
1. Co-prime numbers, such as 8 and 15, share no prime factor, so their HCF is 1 and their LCM is their product, 120. The calculator says when the numbers are co-prime.
Up to 10 numbers, each up to 1,000,000,000,000 (10¹²). The LCM is shown in full, however long it is, because the calculator works with exact whole numbers rather than rounded decimals.
Rates and rules change; check the source before you rely on a figure.
Still stuck? Ask about LCM and HCF Calculator, With Prime Factorisation Steps and anybody who knows can answer. No account needed.
On the related tools: Percentage to CGPA Calculator – Percentage back to a CGPA on a 10-point scale, with an editable divisor · CBSE Percentage Calculator (Best of Five) – Class 10 or 12 percentage over your best five subjects, with the 33% pass mark in each.