Search a number
-
+
11010111110102 = 2131291328013797
BaseRepresentation
bin1010000000110111110111…
…0000101111101111010110
31102222120000120111021211202
42200031331300233233112
52420342201421010402
635225550351432502
72214311550202406
oct240157560575726
942876016437752
1011010111110102
1135653a8763655
1212999bbb25732
1361b331144c40
142a0c6c37c806
151415e91b3b02
hexa037dc2fbd6

11010111110102 has 16 divisors (see below), whose sum is σ = 17799340734672. Its totient is φ = 5077653562080.

The previous prime is 11010111110021. The next prime is 11010111110183. The reversal of 11010111110102 is 20101111101011.

It is a happy number.

It is an interprime number because it is at equal distance from previous prime (11010111110021) and next prime (11010111110183).

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, 163973333 + ... + 164040464.

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

Almost surely, 211010111110102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 328015103.

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

Adding to 11010111110102 its reverse (20101111101011), we get a palindrome (31111222211113).

Subtracting 11010111110102 from its reverse (20101111101011), we obtain a palindrome (9090999990909).

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

Divisors: 1 2 13 26 1291 2582 16783 33566 328013797 656027594 4264179361 8528358722 423465811927 846931623854 5505055555051 11010111110102