Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,058; 200,000,000,518) = ?
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,518 = 2 × 29 × 3,448,275,871
200,000,000,518 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,518 ÷ 100,000,058 = 1,999 + 99,884,576
Step 2. Divide the smaller number by the above operation's remainder:
100,000,058 ÷ 99,884,576 = 1 + 115,482
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,884,576 ÷ 115,482 = 864 + 108,128
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
115,482 ÷ 108,128 = 1 + 7,354
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
108,128 ÷ 7,354 = 14 + 5,172
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,354 ÷ 5,172 = 1 + 2,182
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,172 ÷ 2,182 = 2 + 808
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,182 ÷ 808 = 2 + 566
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
808 ÷ 566 = 1 + 242
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
566 ÷ 242 = 2 + 82
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
242 ÷ 82 = 2 + 78
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
82 ÷ 78 = 1 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
78 ÷ 4 = 19 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
4 ÷ 2 = 2 + 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,518) = 2
The two numbers have common prime factors