Let M – the sum of the prime natural divisors of an integer, not counting one and the number itself. If the number does not have such divisors, then the M value is considered equal to zero.
Write a program that iterates over integers greater than 500 000, in ascending order and searches among them for those for which the value 10000 < M < 50000 . Print the first five found numbers
and their corresponding M.
values
Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value M (separated by one space). Lines are displayed in ascending order of found numbers.