Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,016; 2,024,936) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,016 = 24 × 11 × 73 × 467
6,000,016 is not a prime number but a composite one.
2,024,936 = 23 × 37 × 6,841
2,024,936 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,016 ÷ 2,024,936 = 2 + 1,950,144
Step 2. Divide the smaller number by the above operation's remainder:
2,024,936 ÷ 1,950,144 = 1 + 74,792
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,144 ÷ 74,792 = 26 + 5,552
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,792 ÷ 5,552 = 13 + 2,616
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
5,552 ÷ 2,616 = 2 + 320
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,616 ÷ 320 = 8 + 56
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
320 ÷ 56 = 5 + 40
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
56 ÷ 40 = 1 + 16
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
40 ÷ 16 = 2 + 8
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
16 ÷ 8 = 2 + 0
At this step, the remainder is zero, so we stop:
8 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,016; 2,024,936) = 8 = 23
The two numbers have common prime factors