Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,017; 200,000,000,064) = ?
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,064 = 26 × 3 × 13,921 × 74,827
200,000,000,064 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,064 ÷ 100,000,017 = 1,999 + 99,966,081
Step 2. Divide the smaller number by the above operation's remainder:
100,000,017 ÷ 99,966,081 = 1 + 33,936
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,966,081 ÷ 33,936 = 2,945 + 24,561
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
33,936 ÷ 24,561 = 1 + 9,375
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
24,561 ÷ 9,375 = 2 + 5,811
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,375 ÷ 5,811 = 1 + 3,564
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,811 ÷ 3,564 = 1 + 2,247
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,564 ÷ 2,247 = 1 + 1,317
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,247 ÷ 1,317 = 1 + 930
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,317 ÷ 930 = 1 + 387
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
930 ÷ 387 = 2 + 156
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
387 ÷ 156 = 2 + 75
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
156 ÷ 75 = 2 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
75 ÷ 6 = 12 + 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,017; 200,000,000,064) = 3
The two numbers have common prime factors