Henry Ernest Dudeney/Puzzles and Curious Problems/106 - Digits and Primes

Puzzles and Curious Problems by Henry Ernest Dudeney: $106$

Digits and Primes

Using the $9$ digits once, and once only,

can you find prime numbers that will add up to the smallest total possible?

Here is an example. The four primes contain all the $9$ digits once, and once only, and add up to $450$,

but this total can be considerably reduced.

It is quite an easy puzzle.

   6 1
 2 8 3
   4 7
+  5 9
------
 4 5 0

Sources

• 1932: Henry Ernest Dudeney: Puzzles and Curious Problems ... (previous) ... (next): Arithmetical and Algebraical Problems: Digital Puzzles: $106$. -- Digits and Primes
• 1968: Henry Ernest Dudeney: 536 Puzzles & Curious Problems ... (previous) ... (next): Arithmetical and Algebraical Problems: Digital Puzzles: $134$. Digits and Primes