Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,630; 2,024,945) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,630 = 2 × 5 × 7 × 13 × 19 × 347
5,999,630 is not a prime number but a composite one.
2,024,945 = 5 × 13 × 31,153
2,024,945 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,630 ÷ 2,024,945 = 2 + 1,949,740
Step 2. Divide the smaller number by the above operation's remainder:
2,024,945 ÷ 1,949,740 = 1 + 75,205
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,740 ÷ 75,205 = 25 + 69,615
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,205 ÷ 69,615 = 1 + 5,590
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
69,615 ÷ 5,590 = 12 + 2,535
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,590 ÷ 2,535 = 2 + 520
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,535 ÷ 520 = 4 + 455
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
520 ÷ 455 = 1 + 65
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
455 ÷ 65 = 7 + 0
At this step, the remainder is zero, so we stop:
65 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,630; 2,024,945) = 65 = 5 × 13
The two numbers have common prime factors