# Sum of primes

In a set of $$n$$ different prime numbers, the digits 1 through 9 are used only once. What is smallest possible sum of these $$n$$ prime numbers?

×