Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,077; 200,000,000,619) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,077 = 3 × 33,333,359
100,000,077 is not a prime number but a composite one.
200,000,000,619 = 32 × 109 × 203,873,599
200,000,000,619 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,619 ÷ 100,000,077 = 1,999 + 99,846,696
Step 2. Divide the smaller number by the above operation's remainder:
100,000,077 ÷ 99,846,696 = 1 + 153,381
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,846,696 ÷ 153,381 = 650 + 149,046
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
153,381 ÷ 149,046 = 1 + 4,335
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
149,046 ÷ 4,335 = 34 + 1,656
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,335 ÷ 1,656 = 2 + 1,023
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,656 ÷ 1,023 = 1 + 633
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,023 ÷ 633 = 1 + 390
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
633 ÷ 390 = 1 + 243
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
390 ÷ 243 = 1 + 147
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
243 ÷ 147 = 1 + 96
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
147 ÷ 96 = 1 + 51
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
96 ÷ 51 = 1 + 45
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
51 ÷ 45 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
45 ÷ 6 = 7 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,077; 200,000,000,619) = 3
The two numbers have common prime factors