Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,058; 200,000,000,330) = ?
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,330 = 2 × 5 × 13 × 61 × 25,220,681
200,000,000,330 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,330 ÷ 100,000,058 = 1,999 + 99,884,388
Step 2. Divide the smaller number by the above operation's remainder:
100,000,058 ÷ 99,884,388 = 1 + 115,670
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,884,388 ÷ 115,670 = 863 + 61,178
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
115,670 ÷ 61,178 = 1 + 54,492
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
61,178 ÷ 54,492 = 1 + 6,686
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
54,492 ÷ 6,686 = 8 + 1,004
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,686 ÷ 1,004 = 6 + 662
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,004 ÷ 662 = 1 + 342
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
662 ÷ 342 = 1 + 320
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
342 ÷ 320 = 1 + 22
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
320 ÷ 22 = 14 + 12
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
22 ÷ 12 = 1 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
12 ÷ 10 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 2 = 5 + 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,330) = 2
The two numbers have common prime factors