Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,094; 200,000,000,604) = ?
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,604 = 22 × 3 × 66,467 × 250,751
200,000,000,604 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,604 ÷ 100,000,094 = 1,999 + 99,812,698
Step 2. Divide the smaller number by the above operation's remainder:
100,000,094 ÷ 99,812,698 = 1 + 187,396
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,812,698 ÷ 187,396 = 532 + 118,026
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
187,396 ÷ 118,026 = 1 + 69,370
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
118,026 ÷ 69,370 = 1 + 48,656
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
69,370 ÷ 48,656 = 1 + 20,714
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
48,656 ÷ 20,714 = 2 + 7,228
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
20,714 ÷ 7,228 = 2 + 6,258
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
7,228 ÷ 6,258 = 1 + 970
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
6,258 ÷ 970 = 6 + 438
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
970 ÷ 438 = 2 + 94
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
438 ÷ 94 = 4 + 62
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
94 ÷ 62 = 1 + 32
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
62 ÷ 32 = 1 + 30
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
32 ÷ 30 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
30 ÷ 2 = 15 + 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,604) = 2
The two numbers have common prime factors