Search a number
-
+
11011010101102 = 211739367699237
BaseRepresentation
bin1010000000111011001101…
…0110000111111101101110
31102222122100020002202122201
42200032303112013331232
52420401022041213402
635230215504132114
72214343044406414
oct240166326077556
942878306082581
1011011010101102
11356581a166920
12129a01100703a
1361b44547728b
142a0d159152b4
1514164d091687
hexa03b3587f6e

11011010101102 has 16 divisors (see below), whose sum is σ = 18020453967792. Its totient is φ = 5004327525120.

The previous prime is 11011010101079. The next prime is 11011010101121. The reversal of 11011010101102 is 20110101011011.

It is a super-2 number, since 2×110110101011022 (a number of 27 digits) contains 22 as substring.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33686973 + ... + 34012264.

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

Almost surely, 211011010101102 is an apocalyptic number.

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

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

11011010101102 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 67706643.

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

Adding to 11011010101102 its reverse (20110101011011), we get a palindrome (31121111112113).

Subtracting 11011010101102 from its reverse (20110101011011), we obtain a palindrome (9099090909909).

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

Divisors: 1 2 11 22 7393 14786 81323 162646 67699237 135398474 744691607 1489383214 500500459141 1001000918282 5505505050551 11011010101102