Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (14,155,294; 5,435,818,240) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
14,155,294 = 2 × 61 × 116,027
14,155,294 is not a prime number but a composite one.
5,435,818,240 = 28 × 5 × 941 × 4,513
5,435,818,240 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,240 ÷ 14,155,294 = 384 + 185,344
Step 2. Divide the smaller number by the above operation's remainder:
14,155,294 ÷ 185,344 = 76 + 69,150
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
185,344 ÷ 69,150 = 2 + 47,044
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
69,150 ÷ 47,044 = 1 + 22,106
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
47,044 ÷ 22,106 = 2 + 2,832
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
22,106 ÷ 2,832 = 7 + 2,282
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,832 ÷ 2,282 = 1 + 550
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,282 ÷ 550 = 4 + 82
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
550 ÷ 82 = 6 + 58
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
82 ÷ 58 = 1 + 24
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
58 ÷ 24 = 2 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
24 ÷ 10 = 2 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 4 = 2 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,294; 5,435,818,240) = 2
The two numbers have common prime factors