I take an integer $n$ .If $n$ is even, I divide it by $2$, if it is odd, I multiple $n$ by $3$ and add one to the product.I keep doing this till the number reduces to $1$.If I start with $5$ for example,I reach $1$ in $5$ steps. $(16, 8, 4, 2, 1)$. $7$ takes $16$ steps to reach $1$.
The number between $1$ and $2000000000$ that requires the largest number of steps to reach $1$ this way is?