Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (7,364; 911,138) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
7,364 = 22 × 7 × 263
7,364 is not a prime number but a composite one.
911,138 = 2 × 103 × 4,423
911,138 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:
911,138 ÷ 7,364 = 123 + 5,366
Step 2. Divide the smaller number by the above operation's remainder:
7,364 ÷ 5,366 = 1 + 1,998
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
5,366 ÷ 1,998 = 2 + 1,370
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,998 ÷ 1,370 = 1 + 628
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
1,370 ÷ 628 = 2 + 114
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
628 ÷ 114 = 5 + 58
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
114 ÷ 58 = 1 + 56
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
58 ÷ 56 = 1 + 2
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
56 ÷ 2 = 28 + 0
At this step, the remainder is zero, so we stop:
2 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 (7,364; 911,138) = 2
The two numbers have common prime factors