Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,152; 200,000,000,698) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,152 = 23 × 32 × 7 × 198,413
100,000,152 is not a prime number but a composite one.
200,000,000,698 = 2 × 12,251 × 8,162,599
200,000,000,698 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:
200,000,000,698 ÷ 100,000,152 = 1,999 + 99,696,850
Step 2. Divide the smaller number by the above operation's remainder:
100,000,152 ÷ 99,696,850 = 1 + 303,302
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,696,850 ÷ 303,302 = 328 + 213,794
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
303,302 ÷ 213,794 = 1 + 89,508
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
213,794 ÷ 89,508 = 2 + 34,778
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
89,508 ÷ 34,778 = 2 + 19,952
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
34,778 ÷ 19,952 = 1 + 14,826
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
19,952 ÷ 14,826 = 1 + 5,126
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
14,826 ÷ 5,126 = 2 + 4,574
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
5,126 ÷ 4,574 = 1 + 552
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
4,574 ÷ 552 = 8 + 158
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
552 ÷ 158 = 3 + 78
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
158 ÷ 78 = 2 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
78 ÷ 2 = 39 + 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 (100,000,152; 200,000,000,698) = 2
The two numbers have common prime factors