Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,164; 200,000,001,405) = ?
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,405 = 3 × 5 × 17 × 23 × 34,100,597
200,000,001,405 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,405 ÷ 100,000,164 = 1,999 + 99,673,569
Step 2. Divide the smaller number by the above operation's remainder:
100,000,164 ÷ 99,673,569 = 1 + 326,595
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,673,569 ÷ 326,595 = 305 + 62,094
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
326,595 ÷ 62,094 = 5 + 16,125
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
62,094 ÷ 16,125 = 3 + 13,719
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
16,125 ÷ 13,719 = 1 + 2,406
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,719 ÷ 2,406 = 5 + 1,689
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,406 ÷ 1,689 = 1 + 717
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,689 ÷ 717 = 2 + 255
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
717 ÷ 255 = 2 + 207
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
255 ÷ 207 = 1 + 48
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
207 ÷ 48 = 4 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
48 ÷ 15 = 3 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,164; 200,000,001,405) = 3
The two numbers have common prime factors