Several sets of prime numbers, such as {7,83,421, 659} use each of the nine non-zero digits exactly once. What is the smallest possible sum such a set of primes could have? Sets can have any number of primes.

Enter just the number