Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,807; 200,000,000,412) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,807 = 3 × 33,333,269
99,999,807 is not a prime number but a composite one.
200,000,000,412 = 22 × 32 × 5,555,555,567
200,000,000,412 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,412 ÷ 99,999,807 = 2,000 + 386,412
Step 2. Divide the smaller number by the above operation's remainder:
99,999,807 ÷ 386,412 = 258 + 305,511
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
386,412 ÷ 305,511 = 1 + 80,901
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
305,511 ÷ 80,901 = 3 + 62,808
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
80,901 ÷ 62,808 = 1 + 18,093
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
62,808 ÷ 18,093 = 3 + 8,529
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
18,093 ÷ 8,529 = 2 + 1,035
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,529 ÷ 1,035 = 8 + 249
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,035 ÷ 249 = 4 + 39
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
249 ÷ 39 = 6 + 15
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
39 ÷ 15 = 2 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
15 ÷ 9 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
9 ÷ 6 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,807; 200,000,000,412) = 3
The two numbers have common prime factors