Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,084; 200,000,000,166) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,084 = 22 × 271 × 92,251
100,000,084 is not a prime number but a composite one.
200,000,000,166 = 2 × 3 × 89,659 × 371,779
200,000,000,166 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,166 ÷ 100,000,084 = 1,999 + 99,832,250
Step 2. Divide the smaller number by the above operation's remainder:
100,000,084 ÷ 99,832,250 = 1 + 167,834
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,832,250 ÷ 167,834 = 594 + 138,854
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
167,834 ÷ 138,854 = 1 + 28,980
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
138,854 ÷ 28,980 = 4 + 22,934
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
28,980 ÷ 22,934 = 1 + 6,046
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
22,934 ÷ 6,046 = 3 + 4,796
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,046 ÷ 4,796 = 1 + 1,250
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,796 ÷ 1,250 = 3 + 1,046
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,250 ÷ 1,046 = 1 + 204
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,046 ÷ 204 = 5 + 26
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
204 ÷ 26 = 7 + 22
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
26 ÷ 22 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
22 ÷ 4 = 5 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,084; 200,000,000,166) = 2
The two numbers have common prime factors