Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,568; 2,024,988) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,568 = 23 × 7 × 83 × 1,291
6,000,568 is not a prime number but a composite one.
2,024,988 = 22 × 3 × 7 × 24,107
2,024,988 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:
6,000,568 ÷ 2,024,988 = 2 + 1,950,592
Step 2. Divide the smaller number by the above operation's remainder:
2,024,988 ÷ 1,950,592 = 1 + 74,396
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,592 ÷ 74,396 = 26 + 16,296
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,396 ÷ 16,296 = 4 + 9,212
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,296 ÷ 9,212 = 1 + 7,084
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,212 ÷ 7,084 = 1 + 2,128
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,084 ÷ 2,128 = 3 + 700
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,128 ÷ 700 = 3 + 28
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
700 ÷ 28 = 25 + 0
At this step, the remainder is zero, so we stop:
28 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 (6,000,568; 2,024,988) = 28 = 22 × 7
The two numbers have common prime factors