I'm trying to write a method that returns the product of prime digits in a number.
I got stuck after the for loop. I don't know how to multiply all the prime numbers. any help?
An example of the function:
The number 124563 has three prime digits: 2, 5, 3, and the product of these three numbers is 30. So my method should return 30 when supplied with 124563.
