Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,822; 200,000,000,250) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,822 = 2 × 3 × 13 × 97 × 13,217
99,999,822 is not a prime number but a composite one.
200,000,000,250 = 2 × 32 × 53 × 251 × 354,139
200,000,000,250 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,250 ÷ 99,999,822 = 2,000 + 356,250
Step 2. Divide the smaller number by the above operation's remainder:
99,999,822 ÷ 356,250 = 280 + 249,822
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
356,250 ÷ 249,822 = 1 + 106,428
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
249,822 ÷ 106,428 = 2 + 36,966
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
106,428 ÷ 36,966 = 2 + 32,496
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
36,966 ÷ 32,496 = 1 + 4,470
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
32,496 ÷ 4,470 = 7 + 1,206
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,470 ÷ 1,206 = 3 + 852
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,206 ÷ 852 = 1 + 354
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
852 ÷ 354 = 2 + 144
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
354 ÷ 144 = 2 + 66
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
144 ÷ 66 = 2 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
66 ÷ 12 = 5 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 6 = 2 + 0
At this step, the remainder is zero, so we stop:
6 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,822; 200,000,000,250) = 6 = 2 × 3
The two numbers have common prime factors