Find Greatest Common Divisor of 1152 and 1664, using prime factorization.

Step 1 : Find prime factorization of each number.

$$\begin{aligned}1152 =& 2\cdot2\cdot2\cdot2\cdot2\cdot2\cdot2\cdot3\cdot3\\[8pt]1664 =& 2\cdot2\cdot2\cdot2\cdot2\cdot2\cdot2\cdot13\\[8pt]\end{aligned}$$

(view steps on how to factor 1152 and 1664. )

Step 2 : Put a box around factors that are common for all numbers:

$$\begin{aligned}1152 =& \color{blue}{\boxed{2}}\cdot\color{red}{\boxed{2}}\cdot\color{Fuchsia}{\boxed{2}}\cdot\color{Orange}{\boxed{2}}\cdot\color{Purple}{\boxed{2}}\cdot\color{blue}{\boxed{2}}\cdot\color{red}{\boxed{2}}\cdot3\cdot3\\[8pt]1664 =& \color{blue}{\boxed{2}}\cdot\color{red}{\boxed{2}}\cdot\color{Fuchsia}{\boxed{2}}\cdot\color{Orange}{\boxed{2}}\cdot\color{Purple}{\boxed{2}}\cdot\color{blue}{\boxed{2}}\cdot\color{red}{\boxed{2}}\cdot13\\[8pt]\end{aligned}$$

Step 3 : Multiply the boxed numbers together:

$$ GCD = 2\cdot2\cdot2\cdot2\cdot2\cdot2\cdot2 = 128 $$

This solution can be visualized using a Venn diagram.

The GCD equals the product of the numbers at the intersection.

GCD Calculator