Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,940; 200,000,000,574) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,940 = 22 × 5 × 43 × 116,279
99,999,940 is not a prime number but a composite one.
200,000,000,574 = 2 × 32 × 11 × 61 × 16,559,033
200,000,000,574 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,574 ÷ 99,999,940 = 2,000 + 120,574
Step 2. Divide the smaller number by the above operation's remainder:
99,999,940 ÷ 120,574 = 829 + 44,094
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
120,574 ÷ 44,094 = 2 + 32,386
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
44,094 ÷ 32,386 = 1 + 11,708
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
32,386 ÷ 11,708 = 2 + 8,970
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
11,708 ÷ 8,970 = 1 + 2,738
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,970 ÷ 2,738 = 3 + 756
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,738 ÷ 756 = 3 + 470
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
756 ÷ 470 = 1 + 286
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
470 ÷ 286 = 1 + 184
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
286 ÷ 184 = 1 + 102
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
184 ÷ 102 = 1 + 82
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
102 ÷ 82 = 1 + 20
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
82 ÷ 20 = 4 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
20 ÷ 2 = 10 + 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,940; 200,000,000,574) = 2
The two numbers have common prime factors