Prime factorization of $$$1468$$$

Find the prime factorization of $$$1468$$$.

Start with the number $$$2$$$.

Determine whether $$$1468$$$ is divisible by $$$2$$$.

It is divisible, thus, divide $$$1468$$$ by $$${\color{green}2}$$$: $$$\frac{1468}{2} = {\color{red}734}$$$.

Determine whether $$$734$$$ is divisible by $$$2$$$.

It is divisible, thus, divide $$$734$$$ by $$${\color{green}2}$$$: $$$\frac{734}{2} = {\color{red}367}$$$.

The prime number $$${\color{green}367}$$$ has no other factors then $$$1$$$ and $$${\color{green}367}$$$: $$$\frac{367}{367} = {\color{red}1}$$$.

Since we have obtained $$$1$$$, we are done.

Now, just count the number of occurences of the divisors (green numbers), and write down the prime factorization: $$$1468 = 2^{2} \cdot 367$$$.

The prime factorization is $$$1468 = 2^{2} \cdot 367$$$A.