Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,942; 200,000,000,426) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,942 = 2 × 3 × 7 × 2,380,951
99,999,942 is not a prime number but a composite one.
200,000,000,426 = 2 × 47 × 1,303 × 1,632,893
200,000,000,426 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,426 ÷ 99,999,942 = 2,000 + 116,426
Step 2. Divide the smaller number by the above operation's remainder:
99,999,942 ÷ 116,426 = 858 + 106,434
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
116,426 ÷ 106,434 = 1 + 9,992
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
106,434 ÷ 9,992 = 10 + 6,514
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,992 ÷ 6,514 = 1 + 3,478
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,514 ÷ 3,478 = 1 + 3,036
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,478 ÷ 3,036 = 1 + 442
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,036 ÷ 442 = 6 + 384
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
442 ÷ 384 = 1 + 58
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
384 ÷ 58 = 6 + 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,942; 200,000,000,426) = 2
The two numbers have common prime factors