Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,076; 200,000,000,180) = ?
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,180 = 22 × 5 × 33,889 × 295,081
200,000,000,180 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,180 ÷ 100,000,076 = 1,999 + 99,848,256
Step 2. Divide the smaller number by the above operation's remainder:
100,000,076 ÷ 99,848,256 = 1 + 151,820
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,848,256 ÷ 151,820 = 657 + 102,516
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
151,820 ÷ 102,516 = 1 + 49,304
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
102,516 ÷ 49,304 = 2 + 3,908
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
49,304 ÷ 3,908 = 12 + 2,408
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,908 ÷ 2,408 = 1 + 1,500
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,408 ÷ 1,500 = 1 + 908
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,500 ÷ 908 = 1 + 592
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
908 ÷ 592 = 1 + 316
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
592 ÷ 316 = 1 + 276
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
316 ÷ 276 = 1 + 40
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
276 ÷ 40 = 6 + 36
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
40 ÷ 36 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
36 ÷ 4 = 9 + 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,180) = 4 = 22
The two numbers have common prime factors