Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,092; 200,000,000,714) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,092 = 22 × 3 × 71 × 117,371
100,000,092 is not a prime number but a composite one.
200,000,000,714 = 2 × 139 × 719,424,463
200,000,000,714 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,714 ÷ 100,000,092 = 1,999 + 99,816,806
Step 2. Divide the smaller number by the above operation's remainder:
100,000,092 ÷ 99,816,806 = 1 + 183,286
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,816,806 ÷ 183,286 = 544 + 109,222
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
183,286 ÷ 109,222 = 1 + 74,064
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
109,222 ÷ 74,064 = 1 + 35,158
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
74,064 ÷ 35,158 = 2 + 3,748
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
35,158 ÷ 3,748 = 9 + 1,426
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,748 ÷ 1,426 = 2 + 896
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,426 ÷ 896 = 1 + 530
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
896 ÷ 530 = 1 + 366
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
530 ÷ 366 = 1 + 164
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
366 ÷ 164 = 2 + 38
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
164 ÷ 38 = 4 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
38 ÷ 12 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 2 = 6 + 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,092; 200,000,000,714) = 2
The two numbers have common prime factors