Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (14,155,214; 5,435,818,130) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
14,155,214 = 2 × 617 × 11,471
14,155,214 is not a prime number but a composite one.
5,435,818,130 = 2 × 5 × 41 × 263 × 50,411
5,435,818,130 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:
5,435,818,130 ÷ 14,155,214 = 384 + 215,954
Step 2. Divide the smaller number by the above operation's remainder:
14,155,214 ÷ 215,954 = 65 + 118,204
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
215,954 ÷ 118,204 = 1 + 97,750
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
118,204 ÷ 97,750 = 1 + 20,454
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
97,750 ÷ 20,454 = 4 + 15,934
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
20,454 ÷ 15,934 = 1 + 4,520
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,934 ÷ 4,520 = 3 + 2,374
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,520 ÷ 2,374 = 1 + 2,146
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,374 ÷ 2,146 = 1 + 228
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,146 ÷ 228 = 9 + 94
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
228 ÷ 94 = 2 + 40
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
94 ÷ 40 = 2 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
40 ÷ 14 = 2 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 12 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 2 = 6 + 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 (14,155,214; 5,435,818,130) = 2
The two numbers have common prime factors