__Bonus Question__:

Make a list of distinct prime numbers, using the hexadecimal digits from 1 to F exactly once each in the list. What is the minimum sum of all the numbers in such a list? What's the minimum product of all the numbers in such a list?

*Note*: Think of this problem as an extension of

**Pretty Potent Primes**.