Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,058; 200,000,000,310) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,058 = 2 × 241 × 207,469
100,000,058 is not a prime number but a composite one.
200,000,000,310 = 2 × 3 × 5 × 11 × 606,060,607
200,000,000,310 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,310 ÷ 100,000,058 = 1,999 + 99,884,368
Step 2. Divide the smaller number by the above operation's remainder:
100,000,058 ÷ 99,884,368 = 1 + 115,690
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,884,368 ÷ 115,690 = 863 + 43,898
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
115,690 ÷ 43,898 = 2 + 27,894
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
43,898 ÷ 27,894 = 1 + 16,004
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
27,894 ÷ 16,004 = 1 + 11,890
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
16,004 ÷ 11,890 = 1 + 4,114
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
11,890 ÷ 4,114 = 2 + 3,662
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,114 ÷ 3,662 = 1 + 452
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,662 ÷ 452 = 8 + 46
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
452 ÷ 46 = 9 + 38
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
46 ÷ 38 = 1 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
38 ÷ 8 = 4 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 6 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 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,058; 200,000,000,310) = 2
The two numbers have common prime factors