Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (14,155,224; 5,435,818,190) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
14,155,224 = 23 × 3 × 67 × 8,803
14,155,224 is not a prime number but a composite one.
5,435,818,190 = 2 × 5 × 11 × 49,416,529
5,435,818,190 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,190 ÷ 14,155,224 = 384 + 212,174
Step 2. Divide the smaller number by the above operation's remainder:
14,155,224 ÷ 212,174 = 66 + 151,740
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
212,174 ÷ 151,740 = 1 + 60,434
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
151,740 ÷ 60,434 = 2 + 30,872
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
60,434 ÷ 30,872 = 1 + 29,562
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
30,872 ÷ 29,562 = 1 + 1,310
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
29,562 ÷ 1,310 = 22 + 742
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,310 ÷ 742 = 1 + 568
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
742 ÷ 568 = 1 + 174
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
568 ÷ 174 = 3 + 46
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
174 ÷ 46 = 3 + 36
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
46 ÷ 36 = 1 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
36 ÷ 10 = 3 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 6 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 4 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
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 (14,155,224; 5,435,818,190) = 2
The two numbers have common prime factors