🔢
GCD and LCM Calculator
Inputs
First Number
Enter a positive integer
Second Number
Enter a positive integer
Third Number (Optional)
Leave blank or enter 0 to skip
Reset to defaults
Results
Greatest Common Divisor (GCD)
—
Largest number that divides all inputs evenly
Least Common Multiple (LCM)
—
Prime Factors (First Number)
—
Prime Factors (Second Number)
—
Formula
GCD(a,b) = Euclidean Algorithm; LCM(a,b) = (a × b) / GCD(a,b)
Powered by
CalcStudio Pro