For a 16 bit number, you could. split it into two 8 bit numbers, and convert those to arrays of booleans. Then, you could rebuild the arrays into one, and know your bit value.
Preferably (as it uses far less memory and processing time), you could use bitwise logic, and OR (or is it AND) the data with a mask. The mask would be everything but your bit of interest as a 1 (or is it 0) combined with your number to get ONLY the results of the bit in question. Upon some experimentation, it seems that if you NOT the binary number in question, and AND it with all 0s but the bit you are looking for, then use the logical shift negative the number of the bit you are looking for -1, that you will get your answer.
So, these are the steps:
*NOT your data
*AND it
with all 0's except the bit in question
*Logical Shift negative (-) the number corresponding to the bit number minus one, i.e. -3 for the fourth bit.
If you have any trouble, please post here again.