Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,174; 200,000,001,522) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,174 = 2 × 163 × 306,749
100,000,174 is not a prime number but a composite one.
200,000,001,522 = 2 × 3 × 2,129 × 15,656,803
200,000,001,522 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,522 ÷ 100,000,174 = 1,999 + 99,653,696
Step 2. Divide the smaller number by the above operation's remainder:
100,000,174 ÷ 99,653,696 = 1 + 346,478
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,653,696 ÷ 346,478 = 287 + 214,510
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
346,478 ÷ 214,510 = 1 + 131,968
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
214,510 ÷ 131,968 = 1 + 82,542
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
131,968 ÷ 82,542 = 1 + 49,426
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
82,542 ÷ 49,426 = 1 + 33,116
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
49,426 ÷ 33,116 = 1 + 16,310
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
33,116 ÷ 16,310 = 2 + 496
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
16,310 ÷ 496 = 32 + 438
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
496 ÷ 438 = 1 + 58
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
438 ÷ 58 = 7 + 32
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
58 ÷ 32 = 1 + 26
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
32 ÷ 26 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
26 ÷ 6 = 4 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
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,174; 200,000,001,522) = 2
The two numbers have common prime factors