Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,106; 200,000,001,360) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,106 = 2 × 61 × 819,673
100,000,106 is not a prime number but a composite one.
200,000,001,360 = 24 × 3 × 5 × 347 × 2,401,537
200,000,001,360 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,001,360 ÷ 100,000,106 = 1,999 + 99,789,466
Step 2. Divide the smaller number by the above operation's remainder:
100,000,106 ÷ 99,789,466 = 1 + 210,640
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,789,466 ÷ 210,640 = 473 + 156,746
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
210,640 ÷ 156,746 = 1 + 53,894
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
156,746 ÷ 53,894 = 2 + 48,958
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
53,894 ÷ 48,958 = 1 + 4,936
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
48,958 ÷ 4,936 = 9 + 4,534
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,936 ÷ 4,534 = 1 + 402
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,534 ÷ 402 = 11 + 112
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
402 ÷ 112 = 3 + 66
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
112 ÷ 66 = 1 + 46
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
66 ÷ 46 = 1 + 20
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
46 ÷ 20 = 2 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
20 ÷ 6 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 0
At this step, the remainder is zero, so we stop:
2 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,106; 200,000,001,360) = 2
The two numbers have common prime factors