Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,666; 199,999,999,979) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,666 = 2 × 32 × 132 × 71 × 463
99,999,666 is not a prime number but a composite one.
199,999,999,979 = 13 × 23 × 89 × 7,515,689
199,999,999,979 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,979 ÷ 99,999,666 = 2,000 + 667,979
Step 2. Divide the smaller number by the above operation's remainder:
99,999,666 ÷ 667,979 = 149 + 470,795
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
667,979 ÷ 470,795 = 1 + 197,184
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
470,795 ÷ 197,184 = 2 + 76,427
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
197,184 ÷ 76,427 = 2 + 44,330
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
76,427 ÷ 44,330 = 1 + 32,097
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
44,330 ÷ 32,097 = 1 + 12,233
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
32,097 ÷ 12,233 = 2 + 7,631
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
12,233 ÷ 7,631 = 1 + 4,602
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
7,631 ÷ 4,602 = 1 + 3,029
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
4,602 ÷ 3,029 = 1 + 1,573
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
3,029 ÷ 1,573 = 1 + 1,456
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
1,573 ÷ 1,456 = 1 + 117
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
1,456 ÷ 117 = 12 + 52
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
117 ÷ 52 = 2 + 13
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
52 ÷ 13 = 4 + 0
At this step, the remainder is zero, so we stop:
13 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,666; 199,999,999,979) = 13
The two numbers have common prime factors