Prime factorization of $$$1469$$$

Find the prime factorization of $$$1469$$$.

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

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

Since it is not divisible, move to the next prime number.

The next prime number is $$$3$$$.

Determine whether $$$1469$$$ is divisible by $$$3$$$.

Since it is not divisible, move to the next prime number.

The next prime number is $$$5$$$.

Determine whether $$$1469$$$ is divisible by $$$5$$$.

Since it is not divisible, move to the next prime number.

The next prime number is $$$7$$$.

Determine whether $$$1469$$$ is divisible by $$$7$$$.

Since it is not divisible, move to the next prime number.

The next prime number is $$$11$$$.

Determine whether $$$1469$$$ is divisible by $$$11$$$.

Since it is not divisible, move to the next prime number.

The next prime number is $$$13$$$.

Determine whether $$$1469$$$ is divisible by $$$13$$$.

It is divisible, thus, divide $$$1469$$$ by $$${\color{green}13}$$$: $$$\frac{1469}{13} = {\color{red}113}$$$.

The prime number $$${\color{green}113}$$$ has no other factors then $$$1$$$ and $$${\color{green}113}$$$: $$$\frac{113}{113} = {\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: $$$1469 = 13 \cdot 113$$$.

The prime factorization is $$$1469 = 13 \cdot 113$$$A.