Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,089; 200,000,000,859) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,089 = 35 × 7 × 58,789
100,000,089 is not a prime number but a composite one.
200,000,000,859 = 3 × 13,217 × 5,044,009
200,000,000,859 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,859 ÷ 100,000,089 = 1,999 + 99,822,948
Step 2. Divide the smaller number by the above operation's remainder:
100,000,089 ÷ 99,822,948 = 1 + 177,141
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,822,948 ÷ 177,141 = 563 + 92,565
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
177,141 ÷ 92,565 = 1 + 84,576
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
92,565 ÷ 84,576 = 1 + 7,989
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
84,576 ÷ 7,989 = 10 + 4,686
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,989 ÷ 4,686 = 1 + 3,303
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,686 ÷ 3,303 = 1 + 1,383
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,303 ÷ 1,383 = 2 + 537
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,383 ÷ 537 = 2 + 309
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
537 ÷ 309 = 1 + 228
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
309 ÷ 228 = 1 + 81
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
228 ÷ 81 = 2 + 66
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
81 ÷ 66 = 1 + 15
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
66 ÷ 15 = 4 + 6
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
15 ÷ 6 = 2 + 3
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
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 (100,000,089; 200,000,000,859) = 3
The two numbers have common prime factors