Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,019; 200,000,000,739) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,019 = 7 × 14,285,717
100,000,019 is not a prime number but a composite one.
200,000,000,739 = 3 × 7 × 11 × 59 × 14,674,591
200,000,000,739 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,739 ÷ 100,000,019 = 1,999 + 99,962,758
Step 2. Divide the smaller number by the above operation's remainder:
100,000,019 ÷ 99,962,758 = 1 + 37,261
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,962,758 ÷ 37,261 = 2,682 + 28,756
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
37,261 ÷ 28,756 = 1 + 8,505
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
28,756 ÷ 8,505 = 3 + 3,241
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,505 ÷ 3,241 = 2 + 2,023
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,241 ÷ 2,023 = 1 + 1,218
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,023 ÷ 1,218 = 1 + 805
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,218 ÷ 805 = 1 + 413
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
805 ÷ 413 = 1 + 392
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
413 ÷ 392 = 1 + 21
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
392 ÷ 21 = 18 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
21 ÷ 14 = 1 + 7
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 7 = 2 + 0
At this step, the remainder is zero, so we stop:
7 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,019; 200,000,000,739) = 7
The two numbers have common prime factors