Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,882; 200,000,000,076) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,882 = 2 × 32 × 17 × 173 × 1,889
99,999,882 is not a prime number but a composite one.
200,000,000,076 = 22 × 3 × 67 × 239 × 1,040,821
200,000,000,076 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,076 ÷ 99,999,882 = 2,000 + 236,076
Step 2. Divide the smaller number by the above operation's remainder:
99,999,882 ÷ 236,076 = 423 + 139,734
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
236,076 ÷ 139,734 = 1 + 96,342
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
139,734 ÷ 96,342 = 1 + 43,392
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
96,342 ÷ 43,392 = 2 + 9,558
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
43,392 ÷ 9,558 = 4 + 5,160
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,558 ÷ 5,160 = 1 + 4,398
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,160 ÷ 4,398 = 1 + 762
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,398 ÷ 762 = 5 + 588
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
762 ÷ 588 = 1 + 174
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
588 ÷ 174 = 3 + 66
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
174 ÷ 66 = 2 + 42
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
66 ÷ 42 = 1 + 24
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
42 ÷ 24 = 1 + 18
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
24 ÷ 18 = 1 + 6
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
18 ÷ 6 = 3 + 0
At this step, the remainder is zero, so we stop:
6 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,882; 200,000,000,076) = 6 = 2 × 3
The two numbers have common prime factors