Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,728; 2,024,972) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,728 = 24 × 7 × 53,569
5,999,728 is not a prime number but a composite one.
2,024,972 = 22 × 17 × 97 × 307
2,024,972 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,728 ÷ 2,024,972 = 2 + 1,949,784
Step 2. Divide the smaller number by the above operation's remainder:
2,024,972 ÷ 1,949,784 = 1 + 75,188
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,784 ÷ 75,188 = 25 + 70,084
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,188 ÷ 70,084 = 1 + 5,104
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
70,084 ÷ 5,104 = 13 + 3,732
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,104 ÷ 3,732 = 1 + 1,372
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,732 ÷ 1,372 = 2 + 988
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,372 ÷ 988 = 1 + 384
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
988 ÷ 384 = 2 + 220
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
384 ÷ 220 = 1 + 164
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
220 ÷ 164 = 1 + 56
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
164 ÷ 56 = 2 + 52
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
56 ÷ 52 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
52 ÷ 4 = 13 + 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,728; 2,024,972) = 4 = 22
The two numbers have common prime factors