Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,866; 200,000,000,536) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,866 = 2 × 89 × 561,797
99,999,866 is not a prime number but a composite one.
200,000,000,536 = 23 × 72 × 71 × 7,185,973
200,000,000,536 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,536 ÷ 99,999,866 = 2,000 + 268,536
Step 2. Divide the smaller number by the above operation's remainder:
99,999,866 ÷ 268,536 = 372 + 104,474
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
268,536 ÷ 104,474 = 2 + 59,588
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
104,474 ÷ 59,588 = 1 + 44,886
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
59,588 ÷ 44,886 = 1 + 14,702
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
44,886 ÷ 14,702 = 3 + 780
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,702 ÷ 780 = 18 + 662
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
780 ÷ 662 = 1 + 118
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
662 ÷ 118 = 5 + 72
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
118 ÷ 72 = 1 + 46
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
72 ÷ 46 = 1 + 26
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
46 ÷ 26 = 1 + 20
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
26 ÷ 20 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
20 ÷ 6 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,866; 200,000,000,536) = 2
The two numbers have common prime factors