Decimal of 1111 base 2 is 10001010111
the algorithms for finding decimal number equivalent of binary is as follow:
#include
#include
void main()
{ int i,n,j,b[100];
clrscr();
printf("Enter a Number:");
scanf("%d",&n);
i=0;
while(n>0)
{
b[i]=n%2;
n=n/2;
i++;
}
printf("\n\nBinary Equivalent:");
j=i-1;
for(i=j;j>=0;j--)
printf("%d",b[j]);
getch();
}
using this algorithms... the binary equivalent of any number is taken out...!!! enjoy... have any query... email at :- "devilllcreature@Yahoo.com" thank you....!!!
Chat with our AI personalities
To convert the binary number 1111 to base ten, we use the positional value system. Starting from the right, each digit in the binary number represents a power of 2. So, 1111 in binary is equal to 1*(2^3) + 1*(2^2) + 1*(2^1) + 1*(2^0) = 8 + 4 + 2 + 1 = 15 in base ten. Therefore, 1111 in binary is equal to 15 in base ten.
1111 in binary is 15 in decimal.
11000 in base 2 is 24 in decimal. 110 in base 2 is 6 in decimal. 24 - 6 is 18. In base 2 18 is 10010.
The binary number 1111 is 15. The digits in a binary number are exponents of 2 rather than 10, so that for a four digit number in binary, the digit places represent 8, 4, 2, 1 instead of increasing values of 10. 1111 = 8+4+2+1 = 15