1111 + 0001 + 1000 + 0100 = 11100 Remember that in binary, 1 + 1 = 10 (0 carry 1) and 1 + 1 + 1 = 11 (1 carry 1).
0.222 = 1111/5000
.1111 is rational. Rational numbers are numbers that can be written as a fraction. Irrational numbers cannot be expressed as a fraction.
24 = 16 1111 1112, 1121, 1211, 2111 1122,1212,2112,2121,1221,2211 1222,2122,2212,2221 2222
public static void main(String[] args) { for(int i=1;i<5;i++) { for(int j=1;j<5;j++) { System.out.print(i); } System.out.println(); } }
1010 base 2 = 10 base 10 1010 base 10 = 11 1111 0010 base 2
-101
Oh, dude, let's break it down. So, in binary, 10100 minus 1111 is like doing basic subtraction, but with 1s and 0s. When you subtract 1111 from 10100, you get 1001. So, the value of 10100 minus 1111 in binary is 1001. Easy peasy, right?
1111 1111 1111 1111 = 2^16 = 65536
9: 1001 10: 1010 11: 1011 12: 1100 13: 1101 14: 1110 15: 1111 16: 10000
1111 in binary is 15 in decimal. 1111 in decimal is 10001010111‬ in binary.
I assume you mean decimal 64,111 You could assemble a table of powers of 2, then use successive subtraction to convert to the binary expansion. I cheated and used the built-in programming calculator on my PC. It says that 64111 (decimal) = FA6F (hexadecimal) This can easily be expanded to binary digit by digit: F=1111 A=1010 6=0110 F=1111 So the final answer is: 1111101001101111 Note that the number 2^16 = 65,536 (which is slightly bigger) has a binary equivalent of 10000000000000000 i.e., a one followed by 16 zeroes.
1111 in binary is 15 in decimal.
The 1's complement is formed by inverting every binary digit (bit) of the number - if it is a 0 it becomes a 1, otherwise it is a 1 and becomes a 0. If 10 is in base 2, then its 1's compliment is 01 or just 1. If 10 is in base 10, then in binary it is 1010 and its 1's complement is 0101 = 5 in decimal. However, if more bits are being used to store it, there would be leading 0s that get inverted to 1s and so the resultant number is different; examples: 8 bits (a byte): decimal 10 = 0000 1010 → 1111 0101 = 245 in decimal 16 bits: decimal 10 = 0000 0000 0000 1010 → 1111 1111 1111 0101 = 65525 Next, if 2s complement is being used to represent negative numbers, the binary 1111 0101 represents decimal -11; similarly 1111 1111 1111 0101 represents decimal -11.
1110-111 in binary = 999
0000 0000 1111 1000F ( or 15) = 1111 in binary, and 8 = 1000 in binary, so F is 1111 1000
The answer is 1 0101 0111 1110 1011 1011 0011 1111 1010 0001 0111