Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (1,556,765; 122,404) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
1,556,765 = 5 × 7 × 19 × 2,341
1,556,765 is not a prime number but a composite one.
122,404 = 22 × 71 × 431
122,404 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).
But the two numbers have no common prime factors.
Step 1. Divide the larger number by the smaller one:
1,556,765 ÷ 122,404 = 12 + 87,917
Step 2. Divide the smaller number by the above operation's remainder:
122,404 ÷ 87,917 = 1 + 34,487
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
87,917 ÷ 34,487 = 2 + 18,943
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
34,487 ÷ 18,943 = 1 + 15,544
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
18,943 ÷ 15,544 = 1 + 3,399
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
15,544 ÷ 3,399 = 4 + 1,948
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,399 ÷ 1,948 = 1 + 1,451
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,948 ÷ 1,451 = 1 + 497
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,451 ÷ 497 = 2 + 457
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
497 ÷ 457 = 1 + 40
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
457 ÷ 40 = 11 + 17
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
40 ÷ 17 = 2 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
17 ÷ 6 = 2 + 5
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 5 = 1 + 1
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
5 ÷ 1 = 5 + 0
At this step, the remainder is zero, so we stop:
1 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 (1,556,765; 122,404) = 1
Coprime numbers (prime to each other, relatively prime).
The two numbers have no prime factors in common