Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,019; 200,000,000,746) = ?
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,746 = 2 × 7 × 13 × 67 × 1,217 × 13,477
200,000,000,746 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,746 ÷ 100,000,019 = 1,999 + 99,962,765
Step 2. Divide the smaller number by the above operation's remainder:
100,000,019 ÷ 99,962,765 = 1 + 37,254
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,962,765 ÷ 37,254 = 2,683 + 10,283
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
37,254 ÷ 10,283 = 3 + 6,405
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
10,283 ÷ 6,405 = 1 + 3,878
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,405 ÷ 3,878 = 1 + 2,527
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,878 ÷ 2,527 = 1 + 1,351
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,527 ÷ 1,351 = 1 + 1,176
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,351 ÷ 1,176 = 1 + 175
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,176 ÷ 175 = 6 + 126
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
175 ÷ 126 = 1 + 49
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
126 ÷ 49 = 2 + 28
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
49 ÷ 28 = 1 + 21
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
28 ÷ 21 = 1 + 7
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
21 ÷ 7 = 3 + 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,746) = 7
The two numbers have common prime factors