Numbers with prime digits whose sum is 13: Difference between revisions

=={{header|Java}}==

{{trans|Kotlin}}

<lang java>public class PrimeDigits {

private static boolean primeDigitsSum13(int n) {

int sum = 0;

while (n > 0) {

int r = n % 10;

if (r != 2 && r != 3 && r != 5 && r != 7) {

return false;

}

n /= 10;

sum += r;

}

return sum == 13;

}

public static void main(String[] args) {

// using 2 for all digits, 6 digits is the max prior to over-shooting 13

int c = 0;

for (int i = 1; i < 1_000_000; i++) {

if (primeDigitsSum13(i)) {

System.out.printf("%6d ", i);

if (c++ == 10) {

c = 0;

System.out.println();

}

}

}

System.out.println();

}

}</lang>

{{out}}

<pre> 337 355 373 535 553 733 2227 2272 2335 2353 2533

2722 3235 3253 3325 3352 3523 3532 5233 5323 5332 7222

22225 22252 22333 22522 23233 23323 23332 25222 32233 32323 32332

33223 33232 33322 52222 222223 222232 222322 223222 232222 322222 </pre>