Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,748; 2,024,932) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,748 = 22 × 13 × 115,399
6,000,748 is not a prime number but a composite one.
2,024,932 = 22 × 7 × 13 × 5,563
2,024,932 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,748 ÷ 2,024,932 = 2 + 1,950,884
Step 2. Divide the smaller number by the above operation's remainder:
2,024,932 ÷ 1,950,884 = 1 + 74,048
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,884 ÷ 74,048 = 26 + 25,636
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,048 ÷ 25,636 = 2 + 22,776
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
25,636 ÷ 22,776 = 1 + 2,860
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
22,776 ÷ 2,860 = 7 + 2,756
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,860 ÷ 2,756 = 1 + 104
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,756 ÷ 104 = 26 + 52
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
104 ÷ 52 = 2 + 0
At this step, the remainder is zero, so we stop:
52 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,748; 2,024,932) = 52 = 22 × 13
The two numbers have common prime factors