Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,812; 2,024,948) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,812 = 22 × 7 × 13 × 53 × 311
5,999,812 is not a prime number but a composite one.
2,024,948 = 22 × 47 × 10,771
2,024,948 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:
5,999,812 ÷ 2,024,948 = 2 + 1,949,916
Step 2. Divide the smaller number by the above operation's remainder:
2,024,948 ÷ 1,949,916 = 1 + 75,032
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,916 ÷ 75,032 = 25 + 74,116
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,032 ÷ 74,116 = 1 + 916
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
74,116 ÷ 916 = 80 + 836
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
916 ÷ 836 = 1 + 80
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
836 ÷ 80 = 10 + 36
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
80 ÷ 36 = 2 + 8
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
36 ÷ 8 = 4 + 4
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
8 ÷ 4 = 2 + 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 (5,999,812; 2,024,948) = 4 = 22
The two numbers have common prime factors