Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,878; 200,000,000,236) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,878 = 2 × 11 × 4,545,449
99,999,878 is not a prime number but a composite one.
200,000,000,236 = 22 × 50,000,000,059
200,000,000,236 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,236 ÷ 99,999,878 = 2,000 + 244,236
Step 2. Divide the smaller number by the above operation's remainder:
99,999,878 ÷ 244,236 = 409 + 107,354
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
244,236 ÷ 107,354 = 2 + 29,528
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
107,354 ÷ 29,528 = 3 + 18,770
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
29,528 ÷ 18,770 = 1 + 10,758
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
18,770 ÷ 10,758 = 1 + 8,012
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,758 ÷ 8,012 = 1 + 2,746
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,012 ÷ 2,746 = 2 + 2,520
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,746 ÷ 2,520 = 1 + 226
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,520 ÷ 226 = 11 + 34
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
226 ÷ 34 = 6 + 22
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
34 ÷ 22 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
22 ÷ 12 = 1 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 10 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 2 = 5 + 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,878; 200,000,000,236) = 2
The two numbers have common prime factors