Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,656; 200,000,000,198) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,656 = 23 × 29 × 41 × 10,513
99,999,656 is not a prime number but a composite one.
200,000,000,198 = 2 × 17 × 5,882,352,947
200,000,000,198 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,198 ÷ 99,999,656 = 2,000 + 688,198
Step 2. Divide the smaller number by the above operation's remainder:
99,999,656 ÷ 688,198 = 145 + 210,946
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
688,198 ÷ 210,946 = 3 + 55,360
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
210,946 ÷ 55,360 = 3 + 44,866
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
55,360 ÷ 44,866 = 1 + 10,494
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
44,866 ÷ 10,494 = 4 + 2,890
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,494 ÷ 2,890 = 3 + 1,824
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,890 ÷ 1,824 = 1 + 1,066
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,824 ÷ 1,066 = 1 + 758
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,066 ÷ 758 = 1 + 308
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
758 ÷ 308 = 2 + 142
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
308 ÷ 142 = 2 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
142 ÷ 24 = 5 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 22 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 2 = 11 + 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,656; 200,000,000,198) = 2
The two numbers have common prime factors