Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,080; 200,000,000,979) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,080 = 24 × 32 × 5 × 138,889
100,000,080 is not a prime number but a composite one.
200,000,000,979 = 32 × 19 × 1,169,590,649
200,000,000,979 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,979 ÷ 100,000,080 = 1,999 + 99,841,059
Step 2. Divide the smaller number by the above operation's remainder:
100,000,080 ÷ 99,841,059 = 1 + 159,021
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,841,059 ÷ 159,021 = 627 + 134,892
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
159,021 ÷ 134,892 = 1 + 24,129
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
134,892 ÷ 24,129 = 5 + 14,247
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
24,129 ÷ 14,247 = 1 + 9,882
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,247 ÷ 9,882 = 1 + 4,365
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,882 ÷ 4,365 = 2 + 1,152
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,365 ÷ 1,152 = 3 + 909
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,152 ÷ 909 = 1 + 243
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
909 ÷ 243 = 3 + 180
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
243 ÷ 180 = 1 + 63
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
180 ÷ 63 = 2 + 54
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
63 ÷ 54 = 1 + 9
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
54 ÷ 9 = 6 + 0
At this step, the remainder is zero, so we stop:
9 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,080; 200,000,000,979) = 9 = 32
The two numbers have common prime factors