Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,076; 200,000,000,654) = ?
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,654 = 2 × 53 × 13,417 × 140,627
200,000,000,654 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,654 ÷ 100,000,076 = 1,999 + 99,848,730
Step 2. Divide the smaller number by the above operation's remainder:
100,000,076 ÷ 99,848,730 = 1 + 151,346
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,848,730 ÷ 151,346 = 659 + 111,716
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
151,346 ÷ 111,716 = 1 + 39,630
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
111,716 ÷ 39,630 = 2 + 32,456
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
39,630 ÷ 32,456 = 1 + 7,174
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
32,456 ÷ 7,174 = 4 + 3,760
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,174 ÷ 3,760 = 1 + 3,414
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,760 ÷ 3,414 = 1 + 346
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,414 ÷ 346 = 9 + 300
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
346 ÷ 300 = 1 + 46
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
300 ÷ 46 = 6 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
46 ÷ 24 = 1 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 22 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 2 = 11 + 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,654) = 2
The two numbers have common prime factors