Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,490; 7,497) = ?
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.
7,497 = 32 × 72 × 17
7,497 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:
7,497 ÷ 5,490 = 1 + 2,007
Step 2. Divide the smaller number by the above operation's remainder:
5,490 ÷ 2,007 = 2 + 1,476
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
2,007 ÷ 1,476 = 1 + 531
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,476 ÷ 531 = 2 + 414
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
531 ÷ 414 = 1 + 117
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
414 ÷ 117 = 3 + 63
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
117 ÷ 63 = 1 + 54
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
63 ÷ 54 = 1 + 9
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
54 ÷ 9 = 6 + 0
At this step, the remainder is zero, so we stop:
9 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; 7,497) = 9 = 32
The two numbers have common prime factors