Search a number
-
+
11020101100 = 2252110201011
BaseRepresentation
bin10100100001101100…
…10110010111101100
31001110000021010202121
422100312112113230
5140032121213400
65021303002324
7540042212431
oct122066262754
931400233677
1011020101100
114745618078
1221767393a4
131068144aa8
14767823b88
1544771021a
hex290d965ec

11020101100 has 18 divisors (see below), whose sum is σ = 23913619604. Its totient is φ = 4408040400.

The previous prime is 11020101091. The next prime is 11020101101. The reversal of 11020101100 is 110102011.

11020101100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55100406 + ... + 55100605.

Almost surely, 211020101100 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

Adding to 11020101100 its reverse (110102011), we get a palindrome (11130203111).

The spelling of 11020101100 in words is "eleven billion, twenty million, one hundred one thousand, one hundred".

Divisors: 1 2 4 5 10 20 25 50 100 110201011 220402022 440804044 551005055 1102010110 2204020220 2755025275 5510050550 11020101100