0.2
Chat with our AI personalities
They are numbers of the form 210 + 2*n where n = 1, 2, 3, ... 15.
Assuming x is your number, x * 10^n = x moved n decimal places. When n is positive, move the decimal point n places to the right. When n is negative, move the decimal point n places to the left. When n is 0, do nothing.
n-n
One way to accomplish this is to allow the printf statement to do the work for you. Example: printf("Decimal %d = hex %02x\n", number, number); Or you could use the windows calculator. Select the Dec radian, type your number in, then select Hex radian.
this isn't the fact that the binary number 11 will have decimal equivalent 11... instead it have decimal number 1011 for decimal equivalant 11.here is the alogorithms for converting the decimal number to binary equivalent...!!!#include#includevoid 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....!!!