Skip to main content

MAXScanner calculator widget

GCF and LCM Calculator with Prime Factor Steps

Open full guide ↗

Editable live calculator

Change any input — the result updates immediately

No hidden assumptions. Inputs, units and the working stay visible so you can check the calculation.

Calculated result

GCF 12 · LCM 3600

Greatest common factor (GCF, also called HCF or GCD) = 12

Least common multiple (LCM) = 3600

Ladder (cake) method

Divide by48180300
22490150
2124575
341525
5435

Prime factor trees

48 = 2 × 2 × 2 × 2 × 3
482242122623
180 = 2 × 2 × 3 × 3 × 5
18029024531535
300 = 2 × 2 × 3 × 5 × 5
300215027532555
Show the working
  1. 1. Method 1, prime factorization: write each number as a product of primes.
  2. 2. 48 = 2^4 × 3
  3. 3. 180 = 2^2 × 3^2 × 5
  4. 4. 300 = 2^2 × 3 × 5^2
  5. 5. GCF: keep only the primes that divide every number, each with its smallest exponent:
  6. 6. 2^2 × 3 = 12
  7. 7. LCM: keep every prime that appears, each with its largest exponent:
  8. 8. 2^4 × 3^2 × 5^2 = 3600
  9. 9. Method 2, Euclid's algorithm: divide the larger number by the smaller, then the divisor by the remainder, until the remainder is 0. The last divisor is the GCF.
  10. 10. With more than two numbers, repeat with the running GCF and the next number: GCF(a, b, c) = GCF(GCF(a, b), c).
  11. 11. 180 = 3 × 48 + 36
  12. 12. 48 = 1 × 36 + 12
  13. 13. 36 = 3 × 12 + 0
  14. 14. GCF(48, 180) = 12
  15. 15. 300 = 25 × 12 + 0
  16. 16. GCF(12, 300) = 12
  17. 17. LCM from the GCF, one pair at a time: LCM(a, b) = a × b ÷ GCF(a, b).
  18. 18. LCM(48, 180) = 48 × 180 ÷ 12 = 720
  19. 19. LCM(720, 300) = 720 × 300 ÷ 60 = 3600
  20. 20. Method 3, ladder (cake) method, in the table: divide the row by a prime that divides every number, as long as one exists; those divisors multiply to the GCF. Then divide by primes that divide at least two numbers, carrying the others down unchanged. The LCM is every divisor times the bottom row.
  21. 21. GCF from the ladder, the divisors used while every number could be divided:
  22. 22. 2 × 2 × 3 = 12
  23. 23. LCM from the ladder, every divisor times the numbers left in the bottom row:
  24. 24. 2 × 2 × 3 × 5 × 4 × 3 × 5 = 3600
More actions

Shared links reopen these inputs. Recent and saved calculations stay in this browser unless you clear site data.