The proof that every number can be seen as a sum-of-the-products-of-primenumbers is easy. E.g. for 1999:

1999 = 1 + 1 + 1 + ... + 1 (1999 ones).

Since 1 is a prime number 1999 is the sum of prime numbers.       (1)

Now replace 43 ones by the number 43. And 5*17*23 ones by 5*17*23. Then you get 1999 = 5*17*23 + 43 + 1       (2)

Start writing the number as a sum of ones, choose a number of fitting primes and prime products and replace corresponding groups of ones by the prime products of your choice. So any number can be written as a sum-of-the-products-of-primenumbers in the way of your choice.       (3)



10 figures and 22 letters, 32 bytes of 5 bits each.

00000001000810000H11000P
00001101001910001I11001R
00010201010A10010J11010S
00011301011B10011K11011T
00100401100D10100L11100U
00101501101E10101M11101W
00110601110F10110N11110Y
00111701111G10111O11111Z
      (4)