Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,092; 200,000,000,388) = ?
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,388 = 22 × 3 × 1,291 × 2,689 × 4,801
200,000,000,388 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,388 ÷ 100,000,092 = 1,999 + 99,816,480
Step 2. Divide the smaller number by the above operation's remainder:
100,000,092 ÷ 99,816,480 = 1 + 183,612
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,816,480 ÷ 183,612 = 543 + 115,164
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
183,612 ÷ 115,164 = 1 + 68,448
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
115,164 ÷ 68,448 = 1 + 46,716
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
68,448 ÷ 46,716 = 1 + 21,732
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
46,716 ÷ 21,732 = 2 + 3,252
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
21,732 ÷ 3,252 = 6 + 2,220
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,252 ÷ 2,220 = 1 + 1,032
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,220 ÷ 1,032 = 2 + 156
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,032 ÷ 156 = 6 + 96
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
156 ÷ 96 = 1 + 60
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
96 ÷ 60 = 1 + 36
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
60 ÷ 36 = 1 + 24
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
36 ÷ 24 = 1 + 12
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
24 ÷ 12 = 2 + 0
At this step, the remainder is zero, so we stop:
12 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,388) = 12 = 22 × 3
The two numbers have common prime factors