Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,038; 2,024,932) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,038 = 2 × 11 × 223 × 1,223
6,000,038 is not a prime number but a composite one.
2,024,932 = 22 × 7 × 13 × 5,563
2,024,932 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,038 ÷ 2,024,932 = 2 + 1,950,174
Step 2. Divide the smaller number by the above operation's remainder:
2,024,932 ÷ 1,950,174 = 1 + 74,758
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,174 ÷ 74,758 = 26 + 6,466
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,758 ÷ 6,466 = 11 + 3,632
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
6,466 ÷ 3,632 = 1 + 2,834
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,632 ÷ 2,834 = 1 + 798
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,834 ÷ 798 = 3 + 440
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
798 ÷ 440 = 1 + 358
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
440 ÷ 358 = 1 + 82
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
358 ÷ 82 = 4 + 30
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
82 ÷ 30 = 2 + 22
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
30 ÷ 22 = 1 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
22 ÷ 8 = 2 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 6 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 0
At this step, the remainder is zero, so we stop:
2 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,038; 2,024,932) = 2
The two numbers have common prime factors