Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,094; 200,000,000,778) = ?
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,778 = 2 × 3 × 33,333,333,463
200,000,000,778 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,778 ÷ 100,000,094 = 1,999 + 99,812,872
Step 2. Divide the smaller number by the above operation's remainder:
100,000,094 ÷ 99,812,872 = 1 + 187,222
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,812,872 ÷ 187,222 = 533 + 23,546
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
187,222 ÷ 23,546 = 7 + 22,400
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
23,546 ÷ 22,400 = 1 + 1,146
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
22,400 ÷ 1,146 = 19 + 626
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,146 ÷ 626 = 1 + 520
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
626 ÷ 520 = 1 + 106
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
520 ÷ 106 = 4 + 96
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
106 ÷ 96 = 1 + 10
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
96 ÷ 10 = 9 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
10 ÷ 6 = 1 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
6 ÷ 4 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,094; 200,000,000,778) = 2
The two numbers have common prime factors