Search a number
-
+
11001211101 = 34200367807
BaseRepresentation
bin10100011111011100…
…10010100011011101
31001101200201102120000
422033232102203131
5140012302223401
65015350044513
7536422515516
oct121756224335
931350642500
1011001211101
114735995801
122170349739
13106425c98a
14765107a0d
15445c2d186
hex28fb928dd

11001211101 has 20 divisors (see below), whose sum is σ = 16442355072. Its totient is φ = 7330371048.

The previous prime is 11001211097. The next prime is 11001211157. The reversal of 11001211101 is 10111210011.

It is not a de Polignac number, because 11001211101 - 22 = 11001211097 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11001211171) 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 19 ways as a sum of consecutive naturals, for example, 128340 + ... + 196146.

Almost surely, 211001211101 is an apocalyptic number.

It is an amenable number.

11001211101 is a deficient number, since it is larger than the sum of its proper divisors (5441143971).

11001211101 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 11001211101 its reverse (10111210011), we get a palindrome (21112421112).

It can be divided in two parts, 1100 and 1211101, that added together give a square (1212201 = 11012).

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

Divisors: 1 3 9 27 81 2003 6009 18027 54081 67807 162243 203421 610263 1830789 5492367 135817421 407452263 1222356789 3667070367 11001211101