GCF (HCF) of 1152 and 1664

"Greatest Common Factor" Calculator
Greatest Common Factor of
and

What is the Greatest Common Divisor of 1,152 and 1,664?

Answer

GCF (HCF) of 1,152 and 1,664 is
128

Common factors: 1, 2, 4, 8, 16, 32, 64, 128

128 divides both: 1,152 ÷ 128 = 9; 1,664 ÷ 128 = 13 — and 9 and 13 share no factor but 1, so no larger number divides both.

1,152 = 27 × 32

1,664 = 27 × 13

Prime1,1521,664Lowest power
2272727
332——
13—13—

— = power 0: the prime is not a factor of this number, so it cannot be in the GCF.

GCF = 27 = 128

See Also

GCF Table

Number 1Number 2GCF
1,1521,6491
1,1521,6506
1,1521,6511
1,1521,6524
1,1521,6533
1,1521,6542
1,1521,6551
1,1521,65672
1,1521,6571
1,1521,6582
1,1521,6593
1,1521,6604
1,1521,6611
1,1521,6626
1,1521,6631
1,1521,664128
1,1521,6659
1,1521,6662
1,1521,6671
1,1521,66812
1,1521,6691
1,1521,6702
1,1521,6713
1,1521,6728
1,1521,6731
1,1521,67418
1,1521,6751
1,1521,6764
1,1521,6773
1,1521,6782

FAQ

What is the Greatest Common Divisor of 1,152 and 1,664?

GCF (HCF) of 1,152 and 1,664 is 128

How to find the GCF of 1,152 and 1,664?

You can find the GCF of 1,152 and 1,664 by listing all factors of both numbers and picking the greatest common one, or by prime factorization. The GCF of 1,152 and 1,664 is 128.

What prime factors do 1,152 and 1,664 share?

The prime factorizations of 1,152 and 1,664 have 2 × 2 × 2 × 2 × 2 × 2 × 2 in common, and multiplying those shared primes gives 128 — exactly the greatest common factor.

How does the GCF reduce the fraction 1152/1664?

Divide the numerator and the denominator by the GCF 128: 1,152 ÷ 128 = 9 and 1,664 ÷ 128 = 13. So 1152/1664 in lowest terms is 9/13.