Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,538; 2,024,925) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,538 = 2 × 3 × 17 × 131 × 449
5,999,538 is not a prime number but a composite one.
2,024,925 = 3 × 52 × 72 × 19 × 29
2,024,925 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,538 ÷ 2,024,925 = 2 + 1,949,688
Step 2. Divide the smaller number by the above operation's remainder:
2,024,925 ÷ 1,949,688 = 1 + 75,237
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,688 ÷ 75,237 = 25 + 68,763
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,237 ÷ 68,763 = 1 + 6,474
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
68,763 ÷ 6,474 = 10 + 4,023
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,474 ÷ 4,023 = 1 + 2,451
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,023 ÷ 2,451 = 1 + 1,572
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,451 ÷ 1,572 = 1 + 879
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,572 ÷ 879 = 1 + 693
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
879 ÷ 693 = 1 + 186
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
693 ÷ 186 = 3 + 135
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
186 ÷ 135 = 1 + 51
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
135 ÷ 51 = 2 + 33
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
51 ÷ 33 = 1 + 18
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
33 ÷ 18 = 1 + 15
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
18 ÷ 15 = 1 + 3
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
15 ÷ 3 = 5 + 0
At this step, the remainder is zero, so we stop:
3 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,538; 2,024,925) = 3
The two numbers have common prime factors