I have to write a program that finds what are called "Vampire Numbers." These are numbers in which the numbers of the number can be rearranged to make a set of numbers that multiply to get that number. For example, 10251 = 51 * 201 and 29632 = 32 * 926.

They can be arranged in any way. The program will be given an input of one integer, then it has to find and print the vampire number that is closest to that integer. for example, if the input was 10, the output would be 126. I have no code on this program yet, because I have no idea where to start really. I can set it up to accept input, but I need help as to making/finding an algorithm that will correctly find the vampire numbers as needed. Thanks if you can help!