GCF of 1152 and 1664 (Greatest Common Factor)
What is the Greatest Common Divisor of 1152 and 1664?
Answer
(One hundred twenty-eight)
Finding GCF for 1152 and 1664 using all factors (divisors) listing
The first method to find GCF for numbers 1152 and 1664 is to list all factors for both numbers and pick the highest common one:
All factors of 1152: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 64, 72, 96, 128, 144, 192, 288, 384, 576, 1152
All factors of 1664: 1, 2, 4, 8, 13, 16, 26, 32, 52, 64, 104, 128, 208, 416, 832, 1664
So the Greatest Common Factor for 1152 and 1664 is 128
Finding GCF for 1152 and 1664 by Prime Factorization
The second method to find GCF for numbers 1152 and 1664 is to list all Prime Factors for both numbers and multiply the common ones:
All Prime Factors of 1152: 2, 2, 2, 2, 2, 2, 2, 3, 3
All Prime Factors of 1664: 2, 2, 2, 2, 2, 2, 2, 13
As we can see there are Prime Factors common to both numbers: 2, 2, 2, 2, 2, 2, 2
Now we need to multiply them to find GCF: 2 × 2 × 2 × 2 × 2 × 2 × 2 = 128
Related Calculations
See Also
- Least Common Multiple - Find the Least Common Multiple (LCM) of two numbers

GCF Table
| Number 1 | Number 2 | GCF |
|---|---|---|
| 1152 | 1649 | 1 |
| 1152 | 1650 | 6 |
| 1152 | 1651 | 1 |
| 1152 | 1652 | 4 |
| 1152 | 1653 | 3 |
| 1152 | 1654 | 2 |
| 1152 | 1655 | 1 |
| 1152 | 1656 | 72 |
| 1152 | 1657 | 1 |
| 1152 | 1658 | 2 |
| 1152 | 1659 | 3 |
| 1152 | 1660 | 4 |
| 1152 | 1661 | 1 |
| 1152 | 1662 | 6 |
| 1152 | 1663 | 1 |
| 1152 | 1664 | 128 |
| 1152 | 1665 | 9 |
| 1152 | 1666 | 2 |
| 1152 | 1667 | 1 |
| 1152 | 1668 | 12 |
| 1152 | 1669 | 1 |
| 1152 | 1670 | 2 |
| 1152 | 1671 | 3 |
| 1152 | 1672 | 8 |
| 1152 | 1673 | 1 |
| 1152 | 1674 | 18 |
| 1152 | 1675 | 1 |
| 1152 | 1676 | 4 |
| 1152 | 1677 | 3 |
| 1152 | 1678 | 2 |
About "Greatest Common Factor" Calculator
Greatest Common Factor (GCF) also known as the Greatest Common Divisor (GCD) or Highest Common Factor (HCF) - it is the largest positive integer that divides each of the integers with zero remainder.