Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,106; 200,000,000,572) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,106 = 2 × 61 × 819,673
100,000,106 is not a prime number but a composite one.
200,000,000,572 = 22 × 17 × 43 × 97 × 463 × 1,523
200,000,000,572 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,572 ÷ 100,000,106 = 1,999 + 99,788,678
Step 2. Divide the smaller number by the above operation's remainder:
100,000,106 ÷ 99,788,678 = 1 + 211,428
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,788,678 ÷ 211,428 = 471 + 206,090
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
211,428 ÷ 206,090 = 1 + 5,338
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
206,090 ÷ 5,338 = 38 + 3,246
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,338 ÷ 3,246 = 1 + 2,092
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,246 ÷ 2,092 = 1 + 1,154
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,092 ÷ 1,154 = 1 + 938
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,154 ÷ 938 = 1 + 216
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
938 ÷ 216 = 4 + 74
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
216 ÷ 74 = 2 + 68
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
74 ÷ 68 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
68 ÷ 6 = 11 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 2 = 3 + 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,106; 200,000,000,572) = 2
The two numbers have common prime factors