Search a number
-
+
101111011122 = 23111531985017
BaseRepresentation
bin101111000101010101…
…1111001011100110010
3100122222121012112222210
41132022223321130302
53124033404323442
6114241051512550
710206424261662
oct1361253713462
9318877175883
10101111011122
1139976591210
1217719a58756
1396c4a47284
144c728281a2
15296ba4819c
hex178aaf9732

101111011122 has 16 divisors (see below), whose sum is σ = 220605842592. Its totient is φ = 30639700320.

The previous prime is 101111011121. The next prime is 101111011159. The reversal of 101111011122 is 221110111101.

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

It is a junction number, because it is equal to n+sod(n) for n = 101111011098 and 101111011107.

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

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

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

Almost surely, 2101111011122 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1531985033.

The product of its (nonzero) digits is 4, while the sum is 12.

Adding to 101111011122 its reverse (221110111101), we get a palindrome (322221122223).

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

Divisors: 1 2 3 6 11 22 33 66 1531985017 3063970034 4595955051 9191910102 16851835187 33703670374 50555505561 101111011122