Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,149; 200,000,000,499) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,149 = 3 × 29 × 1,149,427
100,000,149 is not a prime number but a composite one.
200,000,000,499 = 3 × 13 × 5,128,205,141
200,000,000,499 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,499 ÷ 100,000,149 = 1,999 + 99,702,648
Step 2. Divide the smaller number by the above operation's remainder:
100,000,149 ÷ 99,702,648 = 1 + 297,501
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,702,648 ÷ 297,501 = 335 + 39,813
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
297,501 ÷ 39,813 = 7 + 18,810
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
39,813 ÷ 18,810 = 2 + 2,193
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
18,810 ÷ 2,193 = 8 + 1,266
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,193 ÷ 1,266 = 1 + 927
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,266 ÷ 927 = 1 + 339
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
927 ÷ 339 = 2 + 249
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
339 ÷ 249 = 1 + 90
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
249 ÷ 90 = 2 + 69
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
90 ÷ 69 = 1 + 21
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
69 ÷ 21 = 3 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
21 ÷ 6 = 3 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,149; 200,000,000,499) = 3
The two numbers have common prime factors