Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,830; 200,000,000,448) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,830 = 2 × 5 × 7 × 29 × 49,261
99,999,830 is not a prime number but a composite one.
200,000,000,448 = 26 × 34 × 38,580,247
200,000,000,448 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,448 ÷ 99,999,830 = 2,000 + 340,448
Step 2. Divide the smaller number by the above operation's remainder:
99,999,830 ÷ 340,448 = 293 + 248,566
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
340,448 ÷ 248,566 = 1 + 91,882
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
248,566 ÷ 91,882 = 2 + 64,802
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
91,882 ÷ 64,802 = 1 + 27,080
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
64,802 ÷ 27,080 = 2 + 10,642
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
27,080 ÷ 10,642 = 2 + 5,796
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
10,642 ÷ 5,796 = 1 + 4,846
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,796 ÷ 4,846 = 1 + 950
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,846 ÷ 950 = 5 + 96
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
950 ÷ 96 = 9 + 86
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
96 ÷ 86 = 1 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
86 ÷ 10 = 8 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 6 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 4 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
4 ÷ 2 = 2 + 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,830; 200,000,000,448) = 2
The two numbers have common prime factors