Search a number
-
+
11010101111100 = 223252713373633337
BaseRepresentation
bin1010000000110111110100…
…1010100110100100111100
31102222112222212200021210100
42200031331022212210330
52420342141341023400
635225545353241100
72214311366205660
oct240157512464474
942875885607710
1011010101111100
1135653a3054213
1212999b8703190
1361b32c053980
142a0c6acd88a0
151415e838b100
hexa037d2a693c

11010101111100 has 432 divisors, whose sum is σ = 43622495495488. Its totient is φ = 2260225658880.

The previous prime is 11010101111081. The next prime is 11010101111111. The reversal of 11010101111100 is 111110101011.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 1213632 + ... + 4846968.

Almost surely, 211010101111100 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1, while the sum is 9.

Adding to 11010101111100 its reverse (111110101011), we get a palindrome (11121211212111).

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