Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,017; 200,000,000,337) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,017 = 32 × 13 × 31 × 79 × 349
100,000,017 is not a prime number but a composite one.
200,000,000,337 = 3 × 1,319 × 50,543,341
200,000,000,337 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,337 ÷ 100,000,017 = 1,999 + 99,966,354
Step 2. Divide the smaller number by the above operation's remainder:
100,000,017 ÷ 99,966,354 = 1 + 33,663
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,966,354 ÷ 33,663 = 2,969 + 20,907
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
33,663 ÷ 20,907 = 1 + 12,756
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
20,907 ÷ 12,756 = 1 + 8,151
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
12,756 ÷ 8,151 = 1 + 4,605
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,151 ÷ 4,605 = 1 + 3,546
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,605 ÷ 3,546 = 1 + 1,059
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,546 ÷ 1,059 = 3 + 369
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,059 ÷ 369 = 2 + 321
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
369 ÷ 321 = 1 + 48
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
321 ÷ 48 = 6 + 33
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
48 ÷ 33 = 1 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
33 ÷ 15 = 2 + 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,017; 200,000,000,337) = 3
The two numbers have common prime factors