Two bounds to estimate the number of bits in binary representation of an integer of N decimal bits are proposed. One is more approximate to real value and the other is easier to compute. The former one is suitable for classic programming and the later is more practical in embedded computing, especially in development of system on chip (SoC), when used to be a range of computation or to be a condition of searching.