Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,164; 200,000,001,338) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,164 = 22 × 3 × 11 × 757,577
100,000,164 is not a prime number but a composite one.
200,000,001,338 = 2 × 100,000,000,669
200,000,001,338 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,338 ÷ 100,000,164 = 1,999 + 99,673,502
Step 2. Divide the smaller number by the above operation's remainder:
100,000,164 ÷ 99,673,502 = 1 + 326,662
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,673,502 ÷ 326,662 = 305 + 41,592
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
326,662 ÷ 41,592 = 7 + 35,518
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
41,592 ÷ 35,518 = 1 + 6,074
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
35,518 ÷ 6,074 = 5 + 5,148
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,074 ÷ 5,148 = 1 + 926
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,148 ÷ 926 = 5 + 518
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
926 ÷ 518 = 1 + 408
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
518 ÷ 408 = 1 + 110
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
408 ÷ 110 = 3 + 78
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
110 ÷ 78 = 1 + 32
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
78 ÷ 32 = 2 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
32 ÷ 14 = 2 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
14 ÷ 4 = 3 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
4 ÷ 2 = 2 + 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,164; 200,000,001,338) = 2
The two numbers have common prime factors