Create a function that takes an integer argument and returns a list of prime numbers found in the decimal representation of that number (not factors).
For example, extract_primes(1717) returns [7, 7, 17, 17, 71].
The list should be in ascending order. If a prime number appears more than once, every occurrence should be listed. If no prime numbers are found, return an empty list.
extract_primes(1) ➞ []
extract_primes(7) ➞ [7]
extract_primes(73) ➞ [3, 7, 73]
extract_primes(103) ➞ [3]
extract_primes(1313) ➞ [3, 3, 13, 13, 31, 131, 313]
103 contains the prime number 3, but also contains 03. These should be treated as the same number, so the result would simply be [3].