Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,868; 200,000,000,102) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,868 = 22 × 24,999,967
99,999,868 is not a prime number but a composite one.
200,000,000,102 = 2 × 7 × 14,285,714,293
200,000,000,102 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,102 ÷ 99,999,868 = 2,000 + 264,102
Step 2. Divide the smaller number by the above operation's remainder:
99,999,868 ÷ 264,102 = 378 + 169,312
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
264,102 ÷ 169,312 = 1 + 94,790
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
169,312 ÷ 94,790 = 1 + 74,522
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
94,790 ÷ 74,522 = 1 + 20,268
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
74,522 ÷ 20,268 = 3 + 13,718
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
20,268 ÷ 13,718 = 1 + 6,550
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,718 ÷ 6,550 = 2 + 618
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,550 ÷ 618 = 10 + 370
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
618 ÷ 370 = 1 + 248
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
370 ÷ 248 = 1 + 122
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
248 ÷ 122 = 2 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
122 ÷ 4 = 30 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
4 ÷ 2 = 2 + 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,868; 200,000,000,102) = 2
The two numbers have common prime factors