Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,149; 200,000,000,697) = ?
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,697 = 3 × 7 × 7,523 × 1,265,959
200,000,000,697 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,697 ÷ 100,000,149 = 1,999 + 99,702,846
Step 2. Divide the smaller number by the above operation's remainder:
100,000,149 ÷ 99,702,846 = 1 + 297,303
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,702,846 ÷ 297,303 = 335 + 106,341
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
297,303 ÷ 106,341 = 2 + 84,621
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
106,341 ÷ 84,621 = 1 + 21,720
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
84,621 ÷ 21,720 = 3 + 19,461
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,720 ÷ 19,461 = 1 + 2,259
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
19,461 ÷ 2,259 = 8 + 1,389
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,259 ÷ 1,389 = 1 + 870
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,389 ÷ 870 = 1 + 519
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
870 ÷ 519 = 1 + 351
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
519 ÷ 351 = 1 + 168
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
351 ÷ 168 = 2 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
168 ÷ 15 = 11 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 3 = 5 + 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,697) = 3
The two numbers have common prime factors