Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,496; 2,024,964) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,496 = 23 × 3 × 457 × 547
5,999,496 is not a prime number but a composite one.
2,024,964 = 22 × 32 × 56,249
2,024,964 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,496 ÷ 2,024,964 = 2 + 1,949,568
Step 2. Divide the smaller number by the above operation's remainder:
2,024,964 ÷ 1,949,568 = 1 + 75,396
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,568 ÷ 75,396 = 25 + 64,668
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,396 ÷ 64,668 = 1 + 10,728
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
64,668 ÷ 10,728 = 6 + 300
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
10,728 ÷ 300 = 35 + 228
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
300 ÷ 228 = 1 + 72
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
228 ÷ 72 = 3 + 12
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
72 ÷ 12 = 6 + 0
At this step, the remainder is zero, so we stop:
12 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,496; 2,024,964) = 12 = 22 × 3
The two numbers have common prime factors