Search a number
-
+
11011102110100 = 22524147271210853
BaseRepresentation
bin1010000000111011100011…
…0101000111000110010100
31102222122120122020022021101
42200032320311013012110
52420401214120010400
635230232552155444
72214345242440261
oct240167065070624
942878518208241
1011011102110100
11356586709a614
12129a037998b84
1361b45b550781
142a0d23c26268
151416561b856a
hexa03b8d47194

11011102110100 has 144 divisors (see below), whose sum is σ = 25090020135936. Its totient is φ = 4190050944000.

The previous prime is 11011102110067. The next prime is 11011102110109. The reversal of 11011102110100 is 101120111011.

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 (11011102110109) 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 47 ways as a sum of consecutive naturals, for example, 52116274 + ... + 52327126.

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

Almost surely, 211011102110100 is an apocalyptic number.

11011102110100 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 11011102110100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12545010067968).

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

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

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

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

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

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

Adding to 11011102110100 its reverse (101120111011), we get a palindrome (11112222221111).

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

Divisors: 1 2 4 5 10 20 25 41 47 50 82 94 100 164 188 205 235 271 410 470 542 820 940 1025 1084 1175 1355 1927 2050 2350 2710 3854 4100 4700 5420 6775 7708 9635 11111 12737 13550 19270 22222 25474 27100 38540 44444 48175 50948 55555 63685 96350 111110 127370 192700 210853 222220 254740 277775 318425 421706 522217 555550 636850 843412 1044434 1054265 1111100 1273700 2088868 2108530 2611085 4217060 5222170 5271325 8644973 9910091 10444340 10542650 13055425 17289946 19820182 21085300 26110850 34579892 39640364 43224865 49550455 52221700 57141163 86449730 99100910 114282326 172899460 198201820 216124325 228564652 247752275 285705815 406313731 432248650 495504550 571411630 812627462 864497300 991009100 1142823260 1428529075 1625254924 2031568655 2342787683 2685634661 2857058150 4063137310 4685575366 5371269322 5714116300 8126274620 9371150732 10157843275 10742538644 11713938415 13428173305 20315686550 23427876830 26856346610 40631373100 46855753660 53712693220 58569692075 67140866525 110111021101 117139384150 134281733050 220222042202 234278768300 268563466100 440444084404 550555105505 1101110211010 2202220422020 2752775527525 5505551055050 11011102110100