Several sets of prime numbers, such as $\{7,83,421,659\}$ use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have? Provide your answer as an integer.

Let's think step by step and output the final answer within \boxed{}.
user