Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,806; 200,000,000,468) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,806 = 2 × 49,999,903
99,999,806 is not a prime number but a composite one.
200,000,000,468 = 22 × 5,927 × 8,435,971
200,000,000,468 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,468 ÷ 99,999,806 = 2,000 + 388,468
Step 2. Divide the smaller number by the above operation's remainder:
99,999,806 ÷ 388,468 = 257 + 163,530
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
388,468 ÷ 163,530 = 2 + 61,408
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
163,530 ÷ 61,408 = 2 + 40,714
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
61,408 ÷ 40,714 = 1 + 20,694
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
40,714 ÷ 20,694 = 1 + 20,020
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
20,694 ÷ 20,020 = 1 + 674
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
20,020 ÷ 674 = 29 + 474
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
674 ÷ 474 = 1 + 200
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
474 ÷ 200 = 2 + 74
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
200 ÷ 74 = 2 + 52
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
74 ÷ 52 = 1 + 22
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
52 ÷ 22 = 2 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
22 ÷ 8 = 2 + 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,806; 200,000,000,468) = 2
The two numbers have common prime factors