Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (14,155,202; 5,435,818,224) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
14,155,202 = 2 × 7,077,601
14,155,202 is not a prime number but a composite one.
5,435,818,224 = 24 × 3 × 19 × 53 × 112,459
5,435,818,224 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,224 ÷ 14,155,202 = 384 + 220,656
Step 2. Divide the smaller number by the above operation's remainder:
14,155,202 ÷ 220,656 = 64 + 33,218
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
220,656 ÷ 33,218 = 6 + 21,348
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
33,218 ÷ 21,348 = 1 + 11,870
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
21,348 ÷ 11,870 = 1 + 9,478
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
11,870 ÷ 9,478 = 1 + 2,392
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,478 ÷ 2,392 = 3 + 2,302
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,392 ÷ 2,302 = 1 + 90
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,302 ÷ 90 = 25 + 52
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
90 ÷ 52 = 1 + 38
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
52 ÷ 38 = 1 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
38 ÷ 14 = 2 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 10 = 1 + 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 (14,155,202; 5,435,818,224) = 2
The two numbers have common prime factors