Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,474; 2,024,970) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,474 = 2 × 13 × 59 × 3,911
5,999,474 is not a prime number but a composite one.
2,024,970 = 2 × 3 × 5 × 67,499
2,024,970 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,474 ÷ 2,024,970 = 2 + 1,949,534
Step 2. Divide the smaller number by the above operation's remainder:
2,024,970 ÷ 1,949,534 = 1 + 75,436
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,534 ÷ 75,436 = 25 + 63,634
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,436 ÷ 63,634 = 1 + 11,802
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
63,634 ÷ 11,802 = 5 + 4,624
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
11,802 ÷ 4,624 = 2 + 2,554
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,624 ÷ 2,554 = 1 + 2,070
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,554 ÷ 2,070 = 1 + 484
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,070 ÷ 484 = 4 + 134
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
484 ÷ 134 = 3 + 82
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
134 ÷ 82 = 1 + 52
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
82 ÷ 52 = 1 + 30
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
52 ÷ 30 = 1 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
30 ÷ 22 = 1 + 8
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 8 = 2 + 6
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
8 ÷ 6 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
6 ÷ 2 = 3 + 0
At this step, the remainder is zero, so we stop:
2 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,474; 2,024,970) = 2
The two numbers have common prime factors