Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,089; 200,000,000,445) = ?
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,445 = 3 × 5 × 7 × 503 × 3,786,803
200,000,000,445 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,445 ÷ 100,000,089 = 1,999 + 99,822,534
Step 2. Divide the smaller number by the above operation's remainder:
100,000,089 ÷ 99,822,534 = 1 + 177,555
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,822,534 ÷ 177,555 = 562 + 36,624
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
177,555 ÷ 36,624 = 4 + 31,059
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
36,624 ÷ 31,059 = 1 + 5,565
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
31,059 ÷ 5,565 = 5 + 3,234
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,565 ÷ 3,234 = 1 + 2,331
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,234 ÷ 2,331 = 1 + 903
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,331 ÷ 903 = 2 + 525
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
903 ÷ 525 = 1 + 378
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
525 ÷ 378 = 1 + 147
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
378 ÷ 147 = 2 + 84
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
147 ÷ 84 = 1 + 63
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
84 ÷ 63 = 1 + 21
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
63 ÷ 21 = 3 + 0
At this step, the remainder is zero, so we stop:
21 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,445) = 21 = 3 × 7
The two numbers have common prime factors