An elephant writes a sequence of numbers on a board starting with $1$. Each minute, it doubles the sum of all the numbers on the board so far, and without erasing anything, writes the result on the board. It stops after writing a number greater than one billion. How many distinct prime factors does the largest number on the board have?

Let's think step by step and output the final answer within \boxed{}.
user