Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,126; 200,000,000,598) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,126 = 2 × 50,000,063
100,000,126 is not a prime number but a composite one.
200,000,000,598 = 2 × 3 × 167 × 2,237 × 89,227
200,000,000,598 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,598 ÷ 100,000,126 = 1,999 + 99,748,724
Step 2. Divide the smaller number by the above operation's remainder:
100,000,126 ÷ 99,748,724 = 1 + 251,402
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,748,724 ÷ 251,402 = 396 + 193,532
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
251,402 ÷ 193,532 = 1 + 57,870
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
193,532 ÷ 57,870 = 3 + 19,922
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
57,870 ÷ 19,922 = 2 + 18,026
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
19,922 ÷ 18,026 = 1 + 1,896
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
18,026 ÷ 1,896 = 9 + 962
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,896 ÷ 962 = 1 + 934
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
962 ÷ 934 = 1 + 28
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
934 ÷ 28 = 33 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
28 ÷ 10 = 2 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 8 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 2 = 4 + 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,126; 200,000,000,598) = 2
The two numbers have common prime factors