Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,490; 8,787) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,490 = 2 × 32 × 5 × 61
5,490 is not a prime number but a composite one.
8,787 = 3 × 29 × 101
8,787 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:
8,787 ÷ 5,490 = 1 + 3,297
Step 2. Divide the smaller number by the above operation's remainder:
5,490 ÷ 3,297 = 1 + 2,193
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
3,297 ÷ 2,193 = 1 + 1,104
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
2,193 ÷ 1,104 = 1 + 1,089
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
1,104 ÷ 1,089 = 1 + 15
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,089 ÷ 15 = 72 + 9
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15 ÷ 9 = 1 + 6
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9 ÷ 6 = 1 + 3
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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 (5,490; 8,787) = 3
The two numbers have common prime factors