1. Start by dividing 1150 by the smallest prime number, which is 2:
1150 \div 2 = 575
So, the first prime factor is 2.
2. Next, we check 575. It is not divisible by 2, so we test the next smallest prime number, which is 3. It is not divisible by 3 either because the sum of its digits is 17, which is not divisible by 3.
3. The next smallest prime number is 5. Since 575 ends in 5, it is divisible by 5:
575 \div 5 = 115
Thus, a prime factor is 5.
4. Next, we verify 115. It ends with 5, so divide by 5 again:
115 \div 5 = 23
So, another factor is 5.
5. Finally, 23 is already a prime number.
Therefore, the prime factors of 1150 are: 2 \times 5^2 \times 23.