Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (108,498; 53,560) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
108,498 = 2 × 3 × 132 × 107
108,498 is not a prime number but a composite one.
53,560 = 23 × 5 × 13 × 103
53,560 is not a prime number but a composite one.
- Prime number: a natural number that is only divisible by 1 and itself. A prime number has exactly two factors: 1 and itself.
- Composite number: a natural number that has at least one other factor than 1 and itself.
Calculate the greatest (highest) common factor (divisor):
Multiply all the common prime factors, taken by their smallest exponents (the smallest powers).
Step 1. Divide the larger number by the smaller one:
108,498 ÷ 53,560 = 2 + 1,378
Step 2. Divide the smaller number by the above operation's remainder:
53,560 ÷ 1,378 = 38 + 1,196
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,378 ÷ 1,196 = 1 + 182
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,196 ÷ 182 = 6 + 104
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
182 ÷ 104 = 1 + 78
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
104 ÷ 78 = 1 + 26
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
78 ÷ 26 = 3 + 0
At this step, the remainder is zero, so we stop:
26 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
The greatest (highest) common factor (divisor):
gcf, hcf, gcd (108,498; 53,560) = 26 = 2 × 13
The two numbers have common prime factors