GCF
Calculator

Calculate the Greatest Common Factor of two or more numbers with Euclidean algorithm steps and prime factorization.

Input Numbers

Euclidean Algorithm

48 = 18 × 2 + 12
18 = 12 × 1 + 6
12 = 6 × 2 + 0

Prime Factorization

48 = 2^4 x 3
18 = 2 x 3^2

Result

GCF (Greatest Common Factor)

6

LCM (Least Common Multiple)

144

Numbers: 48, 18

Learn more

How does the Euclidean algorithm find the GCF efficiently?

GCF Calculator | ToolsCanvas