Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,908; 200,000,001,060) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,908 = 22 × 379 × 65,963
99,999,908 is not a prime number but a composite one.
200,000,001,060 = 22 × 32 × 5 × 23 × 1,069 × 45,191
200,000,001,060 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,001,060 ÷ 99,999,908 = 2,000 + 185,060
Step 2. Divide the smaller number by the above operation's remainder:
99,999,908 ÷ 185,060 = 540 + 67,508
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
185,060 ÷ 67,508 = 2 + 50,044
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
67,508 ÷ 50,044 = 1 + 17,464
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
50,044 ÷ 17,464 = 2 + 15,116
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
17,464 ÷ 15,116 = 1 + 2,348
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,116 ÷ 2,348 = 6 + 1,028
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,348 ÷ 1,028 = 2 + 292
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,028 ÷ 292 = 3 + 152
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
292 ÷ 152 = 1 + 140
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
152 ÷ 140 = 1 + 12
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
140 ÷ 12 = 11 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
12 ÷ 8 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 4 = 2 + 0
At this step, the remainder is zero, so we stop:
4 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 (99,999,908; 200,000,001,060) = 4 = 22
The two numbers have common prime factors