Search a number
-
+
11101010101102 = 259319129481779
BaseRepresentation
bin1010000110001010011111…
…0000111000001101101110
31110022020122110222110210001
42201202213300320031232
52423334332041213402
635335422244334514
72224010243653105
oct241424760701556
943266573873701
1011101010101102
11359aa03887a09
1212b35499a443a
13626a8929954c
142a541281303c
15143b6941d187
hexa18a7c3836e

11101010101102 has 16 divisors (see below), whose sum is σ = 16939051516800. Its totient is φ = 5454718565560.

The previous prime is 11101010101091. The next prime is 11101010101133. The reversal of 11101010101102 is 20110101010111.

It is a super-2 number, since 2×111010101011022 (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, 14364352 + ... + 15117427.

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

Almost surely, 211101010101102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 29485031.

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

Adding to 11101010101102 its reverse (20110101010111), we get a palindrome (31211111111213).

Subtracting 11101010101102 from its reverse (20110101010111), we obtain a palindrome (9009090909009).

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

Divisors: 1 2 59 118 3191 6382 188269 376538 29481779 58963558 1739424961 3478849922 94076356789 188152713578 5550505050551 11101010101102