Binary digit problem? Question: 


  If a system has $32k$ bytes and each such byte has unique address(so $32k$ addresses), what is the smallest possible bits that can be use by every byte for the address ? All the bytes use the same number of bits for the address.


I thought the answer can be found by finding the value to which $2$ can be raised such that it equals $32,000$. I got $2$ raised to $ \sim 14.96$ gives $32,000$. But a byte only has $8$ bits so this can't make any sense. 

Can anyone give any pointer on how to solve this problem ?
The system has 32.000 bytes and each byte must have its own unique address:

32.000 unique addresses

How many bits to represent these?

$2^{15} = 32768$, so if we let addresses be 15 bit we have the address space $[0,32767]$.