Loading the page...
Preparing tools and content for you. This usually takes a second.
Preparing tools and content for you. This usually takes a second.
Fetching calculator categories and tools for this section.
Free greatest common factor calculator. Find GCF (GCD) using Euclidean algorithm, prime factorization, and listing factors. Calculate LCM, all factors, and get step-by-step solutions.
Last updated: February 2, 2026
Need a custom math calculator for your platform? Get a Quote
Enter comma-separated positive integers
GCF (Greatest Common Factor):
12
LCM (Least Common Multiple):
144
Prime Factorizations:
24 = 2 × 2 × 2 × 3
36 = 2 × 2 × 3 × 3
48 = 2 × 2 × 2 × 2 × 3
All Factors:
24: 1, 2, 3, 4, 6, 8, 12, 24
36: 1, 2, 3, 4, 6, 9, 12, 18, 36
48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
Step-by-Step Solution:
1. Given numbers: 24, 36, 48
2. Calculate GCF using Euclidean algorithm
3. GCD(24, 36): 24 = 36 × 0 + 24
4. GCD(36, 24): 36 = 24 × 1 + 12
5. GCD(24, 12): 24 = 12 × 2 + 0
6. GCD(24, 36) = 12
7. Continue calculating GCF for remaining numbers
8. Greatest Common Factor (GCF) = 12
9. Calculate LCM: Least Common Multiple = 144
10. Prime factorizations calculated for all numbers
GCF Tips:
Method
Multiple
Uses Euclidean algorithm for efficiency
Alternative Name
Same as GCF
GCD and GCF are identical concepts
Process
Factor & Multiply
Shows prime factorization of each number
Efficiency
Very Fast
Best for large numbers
Relationship
LCM × GCF
Shows mathematical relationship between them
Terminology
British Term
HCF is another name for GCF
Find GCF of 24, 36, and 48:
GCF
12
LCM
144
Method
Euclidean
Our GCF calculator uses the Euclidean algorithm, one of the oldest and most efficient algorithms in mathematics. It repeatedly applies the division algorithm to find the greatest common divisor, then displays prime factorizations, all factors, and calculates the LCM as well.
GCD(a, b):
1. If b = 0, return a
2. Otherwise, return GCD(b, a mod b)
Repeat until b = 0
The Euclidean algorithm is remarkably efficient, taking O(log min(a,b)) steps. It works by repeatedly replacing the larger number with the remainder of dividing it by the smaller number, until the remainder is 0.
Step 1: 48 = 18 × 2 + 12
Step 2: 18 = 12 × 1 + 6
Step 3: 12 = 6 × 2 + 0
GCF = 6 (last non-zero remainder)
Showing Euclidean algorithm steps and prime factorization
The greatest common factor is fundamental to number theory and has been studied since ancient times. Euclid's algorithm (circa 300 BCE) remains the most efficient method for computing GCF. The algorithm is based on the principle that GCD(a, b) = GCD(b, a mod b), which follows from the division algorithm and properties of divisibility.
Need help with other number theory calculations? Check out our modulus calculator and integer calculator.
Get Custom Calculator for Your PlatformResults:
GCF: 12
LCM: 144
Common Factors: 1, 2, 3, 4, 6, 12
Verification: 12 divides all
GCF(15, 28)
GCF = 1 (no common factors)
GCF(7, 13, 17)
GCF = 1 (all prime)
Share it with others who need help finding GCF