Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,092; 200,000,000,298) = ?
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,298 = 2 × 3 × 7 × 4,761,904,769
200,000,000,298 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,298 ÷ 100,000,092 = 1,999 + 99,816,390
Step 2. Divide the smaller number by the above operation's remainder:
100,000,092 ÷ 99,816,390 = 1 + 183,702
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,816,390 ÷ 183,702 = 543 + 66,204
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
183,702 ÷ 66,204 = 2 + 51,294
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
66,204 ÷ 51,294 = 1 + 14,910
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
51,294 ÷ 14,910 = 3 + 6,564
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,910 ÷ 6,564 = 2 + 1,782
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,564 ÷ 1,782 = 3 + 1,218
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,782 ÷ 1,218 = 1 + 564
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,218 ÷ 564 = 2 + 90
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
564 ÷ 90 = 6 + 24
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
90 ÷ 24 = 3 + 18
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
24 ÷ 18 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
18 ÷ 6 = 3 + 0
At this step, the remainder is zero, so we stop:
6 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,298) = 6 = 2 × 3
The two numbers have common prime factors