Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (4,004,004,238; 456,456,456,450) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
4,004,004,238 = 2 × 13 × 154,000,163
4,004,004,238 is not a prime number but a composite one.
456,456,456,450 = 2 × 32 × 52 × 197 × 5,148,973
456,456,456,450 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:
456,456,456,450 ÷ 4,004,004,238 = 113 + 4,003,977,556
Step 2. Divide the smaller number by the above operation's remainder:
4,004,004,238 ÷ 4,003,977,556 = 1 + 26,682
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
4,003,977,556 ÷ 26,682 = 150,062 + 23,272
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
26,682 ÷ 23,272 = 1 + 3,410
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
23,272 ÷ 3,410 = 6 + 2,812
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,410 ÷ 2,812 = 1 + 598
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,812 ÷ 598 = 4 + 420
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
598 ÷ 420 = 1 + 178
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
420 ÷ 178 = 2 + 64
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
178 ÷ 64 = 2 + 50
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
64 ÷ 50 = 1 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
50 ÷ 14 = 3 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 8 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 6 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 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,004,004,238; 456,456,456,450) = 2
The two numbers have common prime factors