Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,076; 200,000,000,888) = ?
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,888 = 23 × 25,000,000,111
200,000,000,888 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,888 ÷ 100,000,076 = 1,999 + 99,848,964
Step 2. Divide the smaller number by the above operation's remainder:
100,000,076 ÷ 99,848,964 = 1 + 151,112
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,848,964 ÷ 151,112 = 660 + 115,044
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
151,112 ÷ 115,044 = 1 + 36,068
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
115,044 ÷ 36,068 = 3 + 6,840
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
36,068 ÷ 6,840 = 5 + 1,868
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,840 ÷ 1,868 = 3 + 1,236
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,868 ÷ 1,236 = 1 + 632
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,236 ÷ 632 = 1 + 604
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
632 ÷ 604 = 1 + 28
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
604 ÷ 28 = 21 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
28 ÷ 16 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 12 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 4 = 3 + 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,888) = 4 = 22
The two numbers have common prime factors