what is the largest possible number you can write using only 2 digits - just 2 digits, nothing else?
358921
(9^9)!\n\ni.e. factorial of 9 to the power 9\n\n\n\n\n\n\n--- ► λ ◄
1050724
I have to go with 5...if you're still typing you could only have one hand free. And if you have all 5 fingers than that's the maximum number you can have if you are using you fingers and not a piece of paper...is 5. That's my theory. :)
327765
Largest whole number?  There isn't one.
316466
Another answerer gave an example, but I thought it\nmight help to explain it to.\n\nFor any large (or small) number, move the decimal\npoint to just after the first non-zero digit (so\nthat you end up with a number between 1 and 10.\nThen specify the number of digits that the decimal\nwas moved using the "times 10 to the something power"\nnotation.\n\nFor example, 123 would be "1.23 X 10^2"\nOr .00023 would be "2.3 X 10^-4" \n\n(where "^" means "to the power of")
917858
Only 1, 3, and 4 are allowable for the hundreds digit.  Anything goes for the rest.  So there are 3 choices for the hundreds digit, 5 choices for the tens digit since you can't use whatever you cose for the hundreds, and 4 choices left for the ones digit.\n\n3*5*4 = 60
352166
8\ntake away o from top and you're left with o on bottom - half - nothing\nor i guess 10 could work, too (or any double digit ending in 0) take away the first number and you're left with 0
370572
The standard Roman numerals max out at 4999. Beyond 4999 the same numerals are used, but a horizontal bar is placed above them which multiplies it by 1000. \n\nSo for one million you'd have:\n\n_\nM = 1,000,000\n\nGood question!!!
232325
the are 9 1-digit number; 90 2-digits number = 180 digits, we already have 189; 900 3-digit number=2700 digits; we have 2899 digits;\n\n9000 4-digit number= 36000 more digits; total=38,899; \nwe still have 40,000 - 38889 =1,111 digits to go, coming from 5-digit numbers. Dividing by 5, we need 222 5-digit numbers. Startingt from 10000, we are in 10221 and we have 222*5+38889 =39,999. So we need the FIRST digit of the next number (That number being 10,222) So the 40,000 digit of the series is 1.\nVery nice problem. Thanks
61510
In cannot be written!\n\nThe largest Roman numberal represents 1,000,000.\nYou would have to string together 283,468,456,832,465,783 of them in the representation of you number.\n\nIf you could write the characters as small as 1 mm wide, the number would be 283,468,456,832,465 meters wide which is 283,468,456,832 kilometers which is roughly 50 times the mean diameter of the orbit of the planet Pluto.
1043685
Assuming you're not including leading zeros, so 000, 001 are not valid\n\n153, 370, 371 and 407 are the only numbers that fit.
494551
256 - the highest number that can be expressed is 255 (calculation shown below), but 0 is also a valid combination:\n\n1 1 1 1 1 1 1 1\n\n=> 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128\n\n= 255\n\nThis is in a sequence of powers of 2 = 2^0 + 2^1 +...+ 2^7
132537
cm^2 is acceptable to represent superscript, but if you want to be SAVVY you can go cm². Do do that, press and hold the "ALT" key and then, on the number pad, type in 0178. Then let go of the "ALT" Key, and tah-dah!
860441
I'm going to start by assuming that numbers starting with 0, other than zero itself, don't count.  Normally, since there are two choices for any individual digit, the number of numbers possible for any number of digits (d) is 2^d.\n\nHowever, since 0 can't be the starting digit for any but the one-digit numbers, your choices are cut in half, which would be 2^(d-1).\n\nThus, your answer would be the sum of:\n2 + 2^1 + 2^2 +...+ 2^9\n\nInterestingly enough, you'll notice that this answer ends up being 2^10.
930802
not necessary to have whole numbers...you can have decimals like 2.79 5.5 3.2 like these..all these depends on the key you used to represent the data
19288
This is constantly changing cause as soon as you know the largest number you will automaticly know the next number in which case its not the largest number anymore. 100, 101, 102, ... I mean we can all count.\n\nTake "Googolplex" as an example. Which is a Googol^10. (a Googol is 1 followed by 100 zeros)\n\nWhats to stop me from coining the word "Googolopelix" which will be a Googolplex^10
201652
Maybe because we're in base 10 and 9 is the highest base10 one-digit number? Try other bases, and you might get the same conclusion^_^(E.g. 1 in base2, 2 in base3, 3 in base4, 4 in base5, etc.) Just remember that when you sum them up you are still in that base!!!^_^
702009
First try to figure out what is the largest power of two in the given number. in your example, it's 128 which is equal to 2^7.\nThe exponent of 2 signifies that we have a 7 bits or 7 combination of 1 and 0.\nnext, is subtract 128 from the given #.\nthat is,\n141 - 128 = 13.\nNow using the result, find the next largest power of 2. This is\n8 which is equal to 2^3.\nnext, subtract again from the result\n13-8=5.\nthen we have 4 which is 2^2.\nsubtract again.\n5-4=1\nthus the next power of 2 is 1 which is 2^0.\n\nAll the exponents signifies the the position of bit that is a high or equal to 1.\n\nIn your example 144 in binary is equal to\n\n76543210>>>>pertains to the exponent of 2\n10001101>>>>binary equivalent\n\n\nThus\n144 (decimal) = 10001101 (decimal)\n\nIsn't that simple.\n\nYou will figure it out from the start how large or how many bit will a given # of yours contain and you you will identify your MSB.\n\nInstead of dividing by two which will give you the LSB.