Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,059; 2,024,906) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,059 = 13 × 103 × 4,481
6,000,059 is not a prime number but a composite one.
2,024,906 = 2 × 13 × 19 × 4,099
2,024,906 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:
6,000,059 ÷ 2,024,906 = 2 + 1,950,247
Step 2. Divide the smaller number by the above operation's remainder:
2,024,906 ÷ 1,950,247 = 1 + 74,659
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,247 ÷ 74,659 = 26 + 9,113
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,659 ÷ 9,113 = 8 + 1,755
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,113 ÷ 1,755 = 5 + 338
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,755 ÷ 338 = 5 + 65
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
338 ÷ 65 = 5 + 13
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
65 ÷ 13 = 5 + 0
At this step, the remainder is zero, so we stop:
13 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 (6,000,059; 2,024,906) = 13
The two numbers have common prime factors