Hexadecimal representation?
929866
It would be 171 * the sum from i=0 to (k-1) of 256^i.\n\nExample: for k=0, AB = 256^0*171 = 171\nfor k=1, ABAB=(256^1+256^0) * 171 = 43,947\nfor k=2, ABABAB=(256^2+256^1+256^0) * 171 = 11,250,603
345454
Base numbers are used to "encode" the value of an integer into a workable space. When you think about it, a number really represents how far away it is from zero on the number line.\n\nWithout some form of encoding we'd have no easy way to represent these numbers. For example, in base 10, I can represent every integer from zero to just under one million using only 6 digits.\n\nPeople used numbers before our current method of encoding was developed. Consider Roman Numerals. They represent integers, but they have several problems. Their encoding scheme starts to wear out around a million, and it's next to impossible to do basic arithmetic operations with them.\n\nOnce people figured out how to use bases to encode integers, the base number 10 seemed like a pretty good choice. Most languages count in groups of 10 and people have 10 fingers.\n\nThat was pretty much it until people started building computers. There was no easy way to represent the digits from 0 to 9, but there was an easy way to represent the digits 0 and 1. The "bit" was either off or on. This could be rendered by an electrical circuit being on or off.\n\nBy stringing a set of these bits together, engineers figured out to to arrange them to do arthimetic. However, there was one problem. Since the digits where only ones and zeros, the numbers being represented were in a binary representation - or more consistenly put - they were in base 2, because there were only two digits in this encoding system.\n\nLooking a string of zeros and ones gets confusing. While the encoding works, it's tedious for people to do it. Engineers started to cluster the bits together in groups of 3 bits and 4 bits to make it easier to read. There are 8 ways to represent 3 bits and 16 ways to represent 4 bits.\n\n3 bits grouped together are represented by the digits 0 to 7. This is also the same as a base 8 encoding system, also called octal. So there's a very simple mapping between 3 bits and octal.\n\n4 bits grouped together are represented by the "characters" 0-9 followed by A-F. These letters are considered numbers in this representation. This grouping is a base 16 encoding system, and it's called hexadecimal.\n\nEngineers who deal with hardware and device drivers can probably think in octal and hexadecimal, but most of us can't.\n\nSo why don't we use base 10 in computer engineering? Because, it doesn't map to binary. Not all of the bits would be used as they are in octal and hexadecimal. But calculators and computers don't seem to use binary, octal or hexadecimal. Oh, but they do. They just do it "under the hood." Before the answers are shown to you, they're converted into decimal form, so you can understand them easily.\n\nTrust me. Computer Science Circuit Design classes would be a whole lot easier if people were like cartoon characters and only had a total of 8 fingers.
818492
http://en.wikipedia.org/wiki/Image:Hexagon.svg
909215
It can be encoded with another 1*2 matrix through addition.\n\nFor example,\n\noriginal matrix = (x   y)\n\nencoding matrix = (a b)\n\nCoded matrix = (x+a    y+b)
935645
main() { static char *a="n0body"; char b[512],*c,*d;\n  while (c=gets(a)) for (d=a;c;*c^=*d,c++,d=*++d?d:a);\n  printf ("%s&#92;n",b);}\n\n\nhappy?
478761
100,000,000,000,001 or one could give it to you in scientifi notation with a rounding error 10.0 E13
97477
76063 in decimal\n0x1291F in Hexadecimal\n1001 0100 1000 11111 in binary
297836
Not much.  A while ago, it was unclear which representations would be most useful.  Binary is still useful for bit-operations and bit-math (shift, XOR, etc), hex is useful for viewing stack and/or program data.  Octal... not so useful anymore.
981844
2 +28 -65 +48 +99,002,456,486 +1 -87 -998\n= 99,002,455,415\nNote to other answerers:  If you hold your mouse over the string of characters, it will show everything.
461539
printf("%-15u&#92;n",40000);\n\nprovided I understood it correctly.
886281
I GOT THIS ANSWER!! When you write it as a roman numeral!!
808564
printf("$%i.%i",dollars,cents);\n\nor if you have a floating point value you can do\n\nprintf("%5.2f",money);
548330
You aren't specific but i think it could be\n\nHexidecimal, binary, decimal.
12600
In Custom format you can specify format as required by you.\nIt has three parts seperated by ;\n1st is for positive\n2nd is for negetive\n3rd is for Zero\nso you can specify as  follows to get the + sign displyed\n\n+#;-#;"Zero"
734599
kbhit will return a integer to you, go to asciitable.com to find out what des each interger corresponds to what key.\n\ngood luck
889816
1/rt3 *1/rt2-1/rt3\n[1/rt3](1/rt2-1)\n[1/rt3](1-rt2/rt2)\nrationalising\n[(1-rt2)*rt6]/6
295060
That's hexadecimal, you can convert it to ASCII with many online tools such as http://www.vortex.prodigynet.co.uk/misc/ascii_conv.html