Make a list of distinct prime numbers, using the decimal digits from 0 to 9 exactly twice 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? (None of the primes may admit leading zeroes).

Bonus Question:

Make a list of distinct prime numbers, using the duodecimal digits from 0 to B exactly twice 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? (None of the primes may admit leading zeroes).

Note: Think of this problem as an extension of Pretty Potent Primes.