Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,818; 200,000,000,008) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,818 = 2 × 1,223 × 40,883
99,999,818 is not a prime number but a composite one.
200,000,000,008 = 23 × 17,573 × 1,422,637
200,000,000,008 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,008 ÷ 99,999,818 = 2,000 + 364,008
Step 2. Divide the smaller number by the above operation's remainder:
99,999,818 ÷ 364,008 = 274 + 261,626
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
364,008 ÷ 261,626 = 1 + 102,382
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
261,626 ÷ 102,382 = 2 + 56,862
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
102,382 ÷ 56,862 = 1 + 45,520
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
56,862 ÷ 45,520 = 1 + 11,342
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
45,520 ÷ 11,342 = 4 + 152
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
11,342 ÷ 152 = 74 + 94
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
152 ÷ 94 = 1 + 58
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
94 ÷ 58 = 1 + 36
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
58 ÷ 36 = 1 + 22
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
36 ÷ 22 = 1 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
22 ÷ 14 = 1 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 8 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 6 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 2 = 3 + 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 (99,999,818; 200,000,000,008) = 2
The two numbers have common prime factors