Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,058; 200,000,000,586) = ?
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,586 = 2 × 3 × 6,427 × 5,186,453
200,000,000,586 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,586 ÷ 100,000,058 = 1,999 + 99,884,644
Step 2. Divide the smaller number by the above operation's remainder:
100,000,058 ÷ 99,884,644 = 1 + 115,414
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,884,644 ÷ 115,414 = 865 + 51,534
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
115,414 ÷ 51,534 = 2 + 12,346
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
51,534 ÷ 12,346 = 4 + 2,150
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
12,346 ÷ 2,150 = 5 + 1,596
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,150 ÷ 1,596 = 1 + 554
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,596 ÷ 554 = 2 + 488
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
554 ÷ 488 = 1 + 66
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
488 ÷ 66 = 7 + 26
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
66 ÷ 26 = 2 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
26 ÷ 14 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 12 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 2 = 6 + 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,586) = 2
The two numbers have common prime factors