Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,076; 200,000,000,796) = ?
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,796 = 22 × 3 × 16,666,666,733
200,000,000,796 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,796 ÷ 100,000,076 = 1,999 + 99,848,872
Step 2. Divide the smaller number by the above operation's remainder:
100,000,076 ÷ 99,848,872 = 1 + 151,204
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,848,872 ÷ 151,204 = 660 + 54,232
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
151,204 ÷ 54,232 = 2 + 42,740
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
54,232 ÷ 42,740 = 1 + 11,492
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
42,740 ÷ 11,492 = 3 + 8,264
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
11,492 ÷ 8,264 = 1 + 3,228
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,264 ÷ 3,228 = 2 + 1,808
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,228 ÷ 1,808 = 1 + 1,420
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,808 ÷ 1,420 = 1 + 388
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,420 ÷ 388 = 3 + 256
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
388 ÷ 256 = 1 + 132
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
256 ÷ 132 = 1 + 124
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
132 ÷ 124 = 1 + 8
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
124 ÷ 8 = 15 + 4
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
8 ÷ 4 = 2 + 0
At this step, the remainder is zero, so we stop:
4 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,796) = 4 = 22
The two numbers have common prime factors