Computational complexity based in the input size
Let the length of the input (in bits) be $n$ and let the number represented be&nbsp;$m$.  We have $n \approx \log_2 m$ (that's how many bits it takes to write down the number&nbsp;$m$) so $m\approx 2^n$.