Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,759; 199,999,999,986) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,759 = 3 × 33,333,253
99,999,759 is not a prime number but a composite one.
199,999,999,986 = 2 × 3 × 307 × 108,577,633
199,999,999,986 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:
199,999,999,986 ÷ 99,999,759 = 2,000 + 481,986
Step 2. Divide the smaller number by the above operation's remainder:
99,999,759 ÷ 481,986 = 207 + 228,657
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
481,986 ÷ 228,657 = 2 + 24,672
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
228,657 ÷ 24,672 = 9 + 6,609
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
24,672 ÷ 6,609 = 3 + 4,845
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,609 ÷ 4,845 = 1 + 1,764
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,845 ÷ 1,764 = 2 + 1,317
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,764 ÷ 1,317 = 1 + 447
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,317 ÷ 447 = 2 + 423
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
447 ÷ 423 = 1 + 24
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
423 ÷ 24 = 17 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
24 ÷ 15 = 1 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 9 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 6 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,759; 199,999,999,986) = 3
The two numbers have common prime factors