Performs a bitwise 'not' operation of the {number}. A bitwise not is performed by taking the binary representation of the {number} and performing a logical 'not' operation on each of these bits.
Logical "not" Table
| Bit | Result |
| 0 | 1 |
| 1 | 0 |
Unfortunately its not quite as simple as the table above makes it appear since number are a string of 32 (or more bits) so a 1 in binary is actually a 00000000000000000000000000000001 and a 0 is actually a 00000000000000000000000000000000 so the table is now.
bnot of binary 00000000000000000000000000000000
is 11111111111111111111111111111111
which is -1 in decimal
bnot of binary 00000000000000000000000000000001
is 11111111111111111111111111111110
which is -2 in decimal
If you are unsure why the results are negative then you can get more information by reading Twos_complement
[h: val = bnot(num)][h: val = bitwisenot(num)][bnot(1)]Returns 0.
[r: bnot(1)]Returns 0.
[r: bnot(12]Returns -13.