Puzzle of the Week #332 - Even Binary Puzzle

Consider a process by which you take a binary number with an even number of 1s, (for instance 92 = 1011100 has 4 1s), chop the number into two chunks such that each chunk has the same number of 1s, and each chunk begins with 1 (101=5 and 1100=12). Then multiply these two numbers together to give a number smaller than the one you started with (111100=60). If the new number has an even number of 1s, repeat the process, otherwise stop. (11=3 and 1100=12 gives 100100=36; 100=4 and 100=4 gives 10000=16; stop).

 

25 and 32 both convert to binary numbers with an odd number of 1s, (11001 and 100000 respectively).

 

What is the highest number that will eventually terminate in at 25?

 

As a bonus question, what is the highest number that will eventually terminate at 32?