Search a number
-
+
11011010111200 = 25521112143103043
BaseRepresentation
bin1010000000111011001101…
…0110001010011011100000
31102222122100020010021111201
42200032303112022123200
52420401022042024300
635230215504250544
72214343044451021
oct240166326123340
942878306107451
1011011010111200
11356581a173470
12129a011010a54
1361b44547ba58
142a0d15918c48
1514164d09466a
hexa03b358a6e0

11011010111200 has 144 divisors (see below), whose sum is σ = 29327021450496. Its totient is φ = 4003635084800.

The previous prime is 11011010111197. The next prime is 11011010111201. The reversal of 11011010111200 is 211101011011.

It is a Harshad number since it is a multiple of its sum of digits (10).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11011010111201) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 106806879 + ... + 106909921.

It is an arithmetic number, because the mean of its divisors is an integer number (203659871184).

Almost surely, 211011010111200 is an apocalyptic number.

11011010111200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 11011010111200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14663510725248).

11011010111200 is an abundant number, since it is smaller than the sum of its proper divisors (18316011339296).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

11011010111200 is a wasteful number, since it uses less digits than its factorization.

11011010111200 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 115217 (or 115204 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 10.

Adding to 11011010111200 its reverse (211101011011), we get a palindrome (11222111122211).

The spelling of 11011010111200 in words is "eleven trillion, eleven billion, ten million, one hundred eleven thousand, two hundred".

Divisors: 1 2 4 5 8 10 11 16 20 22 25 32 40 44 50 55 80 88 100 110 160 176 200 220 275 352 400 440 550 800 880 1100 1760 2200 4400 8800 12143 24286 48572 60715 97144 103043 121430 133573 194288 206086 242860 267146 303575 388576 412172 485720 515215 534292 607150 667865 824344 971440 1030430 1068584 1133473 1214300 1335730 1648688 1942880 2060860 2137168 2266946 2428600 2576075 2671460 3297376 3339325 4121720 4274336 4533892 4857200 5152150 5342920 5667365 6678650 8243440 9067784 9714400 10304300 10685840 11334730 13357300 16486880 18135568 20608600 21371680 22669460 26714600 28336825 36271136 41217200 45338920 53429200 56673650 82434400 90677840 106858400 113347300 181355680 226694600 453389200 906778400 1251251149 2502502298 5005004596 6256255745 10010009192 12512511490 13763762639 20020018384 25025022980 27527525278 31281278725 40040036768 50050045960 55055050556 62562557450 68818813195 100100091920 110110101112 125125114900 137637626390 200200183840 220220202224 250250229800 275275252780 344094065975 440440404448 500500459600 550550505560 688188131950 1001000919200 1101101011120 1376376263900 2202202022240 2752752527800 5505505055600 11011010111200