Let M – the number of different even natural nontrivial divisors of an integer, and SM is the sum of these divisors.
Write a program that iterates over integers greater than 1 000 000, in ascending order and searches among them for those with M = 5. If such the number has no divisors, then the value of SM is considered equal to zero. Print the first five found numbers and their corresponding SM values.
Output format: for each of the five such found numbers in a separate line, the number itself is displayed first, then – value SM (separated by one space). Lines are displayed in ascending order of found numbers.