140.128.0.0 (10001100 10000000 00000000 00000000).
140.248.0.0
140.128.0.0
140.133.0.0
The number 133 in Binary is 10000101
10000101
10000000 10000001 10000010 10000011 10000100 10000101 10000110 10000111 10001000 10001001
The binary number equivalent of 133 is 10000101. (which for clarity can be grouped, e.g. 1000 0101). A binary number uses exponents of 2 rather than 10, and the first eight digits represent 128, 64, 32, 16, 8, 4, 2, and 1 10000101 = 128 +0+0+0+0+4+0+1 = 133
in EBCDIC: 11001000, 10000101, 10010011, 10010011 10010110 in ASCII: 1001000, 1100101, 1101100, 1101100, 1101111 in Unicode: 0000 0000 0100 1000, 0000 0000 0110 0101, 0000 0000 0110 1100, 0000 0000 0110 1100, 0000 0000 0110 1111
01000101 01011 10101 110101 1010101 101110 11001 11010110 0010101 010101 010101 10101 10101 11101010 10000101 1001 0101011 101101010001 10101 101010 101010 110001001 1010 101 1001 0101001 1000101 101010 1010101 10101 010101 010101 1010010 101001 001010 10101001 10101 1010010 101001 10101 10101 11001
For unsigned maximum negative is 0.For signed maximum negative is -128.The answer depends on how a negative number is represented in binary. Different computers can do this differently. It also affects the maximum value of positive numbers.An 8 bit number can have 256 combinations of 0's and 1's so it can represent 256 different values. We have different conventions for interpreting them. These conventions are built into the hardware and software of the machine.Without recognizing negative numbers, the 256 values represent the number 0-255.If we use signed magnitude representation, a single bit is used to determine if the number is positive or negative. The other 7 bits represent the value. 7 bits represent 127 values and a signed magnitude can have the values 0-127 as well as negative 0 to negative 127. Note that you can have both +0 and -0.0 (00000000) becomes -0 (10000000),5 (00000101) becomes -5 (10000101).The largest negative number here is -127.In 1's complement notation a number is reversed by flipping all the bits of the positive number.0 (00000000) becomes -0 (11111111),5 (00000101) becomes -5 (11111010).Again we get both 0 and -0. The largest negative number here is -127The most commonly use method in use on machines today is called 2's complement. A number is reversed by flipping all the bits and adding one: as follows:1 (00000001) -> 11111110 +1 = 11111111 = -1-1 (11111111) -> 00000000 +1 = 00000001 = 15 (00000101) -> 11111010 +1 = 11111011 = -5126 (01111110) -> 10000001 +1 = 10000010 = -126127 (01111111) -> 10000000 +1 = 10000001 = -127-127 (10000001) -> 01111110 +1 = 01111111 = 127-128 (10000000) -> 01111111 +1 = 10000000 = -128 (there is no positive equivalent here of 128)0 (00000000) -> 11111111 +1 = 1 00000000 = -1 (the one that is carried at the end does not fit into the 8 bit number and is lost. This is called overflow and is not regarded as an error.2's complement arithmetic has a range of positive number 0-127 an negative 1 to negative 128. We use 10000000 as -128 because the top bit position, the 1, is already common for all the negative values. If it were a 9 bit value (01000000) it would be positive 128. It all works out great internally for the computer math processor. The largest negative number here is -128