Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,076; 200,000,000,410) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,076 = 22 × 11 × 2,272,729
100,000,076 is not a prime number but a composite one.
200,000,000,410 = 2 × 5 × 7 × 2,857,142,863
200,000,000,410 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,410 ÷ 100,000,076 = 1,999 + 99,848,486
Step 2. Divide the smaller number by the above operation's remainder:
100,000,076 ÷ 99,848,486 = 1 + 151,590
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,848,486 ÷ 151,590 = 658 + 102,266
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
151,590 ÷ 102,266 = 1 + 49,324
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
102,266 ÷ 49,324 = 2 + 3,618
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
49,324 ÷ 3,618 = 13 + 2,290
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,618 ÷ 2,290 = 1 + 1,328
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,290 ÷ 1,328 = 1 + 962
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,328 ÷ 962 = 1 + 366
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
962 ÷ 366 = 2 + 230
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
366 ÷ 230 = 1 + 136
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
230 ÷ 136 = 1 + 94
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
136 ÷ 94 = 1 + 42
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
94 ÷ 42 = 2 + 10
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
42 ÷ 10 = 4 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
10 ÷ 2 = 5 + 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 (100,000,076; 200,000,000,410) = 2
The two numbers have common prime factors