Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,934; 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,934 = 2 × 3 × 19 × 52,631
5,999,934 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,934 ÷ 2,024,925 = 2 + 1,950,084
Step 2. Divide the smaller number by the above operation's remainder:
2,024,925 ÷ 1,950,084 = 1 + 74,841
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,084 ÷ 74,841 = 26 + 4,218
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,841 ÷ 4,218 = 17 + 3,135
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
4,218 ÷ 3,135 = 1 + 1,083
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,135 ÷ 1,083 = 2 + 969
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,083 ÷ 969 = 1 + 114
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
969 ÷ 114 = 8 + 57
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
114 ÷ 57 = 2 + 0
At this step, the remainder is zero, so we stop:
57 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,934; 2,024,925) = 57 = 3 × 19
The two numbers have common prime factors