Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,024; 2,024,955) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,024 = 23 × 3 × 532 × 89
6,000,024 is not a prime number but a composite one.
2,024,955 = 32 × 5 × 17 × 2,647
2,024,955 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,024 ÷ 2,024,955 = 2 + 1,950,114
Step 2. Divide the smaller number by the above operation's remainder:
2,024,955 ÷ 1,950,114 = 1 + 74,841
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,114 ÷ 74,841 = 26 + 4,248
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,841 ÷ 4,248 = 17 + 2,625
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
4,248 ÷ 2,625 = 1 + 1,623
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,625 ÷ 1,623 = 1 + 1,002
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,623 ÷ 1,002 = 1 + 621
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,002 ÷ 621 = 1 + 381
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
621 ÷ 381 = 1 + 240
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
381 ÷ 240 = 1 + 141
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
240 ÷ 141 = 1 + 99
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
141 ÷ 99 = 1 + 42
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
99 ÷ 42 = 2 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
42 ÷ 15 = 2 + 12
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 12 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
12 ÷ 3 = 4 + 0
At this step, the remainder is zero, so we stop:
3 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,024; 2,024,955) = 3
The two numbers have common prime factors