Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (4,967,400,262; 3,400,200) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
4,967,400,262 = 2 × 11 × 683 × 330,587
4,967,400,262 is not a prime number but a composite one.
3,400,200 = 23 × 32 × 52 × 1,889
3,400,200 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:
4,967,400,262 ÷ 3,400,200 = 1,460 + 3,108,262
Step 2. Divide the smaller number by the above operation's remainder:
3,400,200 ÷ 3,108,262 = 1 + 291,938
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
3,108,262 ÷ 291,938 = 10 + 188,882
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
291,938 ÷ 188,882 = 1 + 103,056
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
188,882 ÷ 103,056 = 1 + 85,826
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
103,056 ÷ 85,826 = 1 + 17,230
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
85,826 ÷ 17,230 = 4 + 16,906
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
17,230 ÷ 16,906 = 1 + 324
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
16,906 ÷ 324 = 52 + 58
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
324 ÷ 58 = 5 + 34
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
58 ÷ 34 = 1 + 24
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
34 ÷ 24 = 1 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
24 ÷ 10 = 2 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 4 = 2 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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 (4,967,400,262; 3,400,200) = 2
The two numbers have common prime factors