Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,094; 200,000,000,572) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,094 = 2 × 50,000,047
100,000,094 is not a prime number but a composite one.
200,000,000,572 = 22 × 17 × 43 × 97 × 463 × 1,523
200,000,000,572 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,572 ÷ 100,000,094 = 1,999 + 99,812,666
Step 2. Divide the smaller number by the above operation's remainder:
100,000,094 ÷ 99,812,666 = 1 + 187,428
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,812,666 ÷ 187,428 = 532 + 100,970
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
187,428 ÷ 100,970 = 1 + 86,458
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
100,970 ÷ 86,458 = 1 + 14,512
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
86,458 ÷ 14,512 = 5 + 13,898
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,512 ÷ 13,898 = 1 + 614
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,898 ÷ 614 = 22 + 390
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
614 ÷ 390 = 1 + 224
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
390 ÷ 224 = 1 + 166
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
224 ÷ 166 = 1 + 58
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
166 ÷ 58 = 2 + 50
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
58 ÷ 50 = 1 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
50 ÷ 8 = 6 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,094; 200,000,000,572) = 2
The two numbers have common prime factors