Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,844; 200,000,000,276) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,844 = 22 × 7 × 3,571,423
99,999,844 is not a prime number but a composite one.
200,000,000,276 = 22 × 19 × 2,631,578,951
200,000,000,276 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,276 ÷ 99,999,844 = 2,000 + 312,276
Step 2. Divide the smaller number by the above operation's remainder:
99,999,844 ÷ 312,276 = 320 + 71,524
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
312,276 ÷ 71,524 = 4 + 26,180
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
71,524 ÷ 26,180 = 2 + 19,164
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
26,180 ÷ 19,164 = 1 + 7,016
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
19,164 ÷ 7,016 = 2 + 5,132
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,016 ÷ 5,132 = 1 + 1,884
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,132 ÷ 1,884 = 2 + 1,364
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,884 ÷ 1,364 = 1 + 520
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,364 ÷ 520 = 2 + 324
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
520 ÷ 324 = 1 + 196
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
324 ÷ 196 = 1 + 128
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
196 ÷ 128 = 1 + 68
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
128 ÷ 68 = 1 + 60
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
68 ÷ 60 = 1 + 8
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
60 ÷ 8 = 7 + 4
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
8 ÷ 4 = 2 + 0
At this step, the remainder is zero, so we stop:
4 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,844; 200,000,000,276) = 4 = 22
The two numbers have common prime factors