Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (1,556,756; 122,464) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
1,556,756 = 22 × 389,189
1,556,756 is not a prime number but a composite one.
122,464 = 25 × 43 × 89
122,464 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:
1,556,756 ÷ 122,464 = 12 + 87,188
Step 2. Divide the smaller number by the above operation's remainder:
122,464 ÷ 87,188 = 1 + 35,276
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
87,188 ÷ 35,276 = 2 + 16,636
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
35,276 ÷ 16,636 = 2 + 2,004
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,636 ÷ 2,004 = 8 + 604
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,004 ÷ 604 = 3 + 192
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
604 ÷ 192 = 3 + 28
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
192 ÷ 28 = 6 + 24
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
28 ÷ 24 = 1 + 4
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
24 ÷ 4 = 6 + 0
At this step, the remainder is zero, so we stop:
4 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,756; 122,464) = 4 = 22
The two numbers have common prime factors