Base | Representation |
---|---|
bin | 1010000111010101101100… |
… | …1111011011110100011111 |
3 | 1110101011202121220121011020 |
4 | 2201311123033123310133 |
5 | 2424202204440231421 |
6 | 35353001555455223 |
7 | 2225323505434212 |
oct | 241653317336437 |
9 | 43334677817136 |
10 | 11121201102111 |
11 | 35a8525102901 |
12 | 12b74438b7513 |
13 | 6289563ca419 |
14 | 2a63aa217779 |
15 | 14444bd16dc6 |
hex | a1d5b3dbd1f |
11121201102111 has 16 divisors (see below), whose sum is σ = 15042772926720. Its totient is φ = 7306960227840.
The previous prime is 11121201102043. The next prime is 11121201102113. The reversal of 11121201102111 is 11120110212111.
It is not a de Polignac number, because 11121201102111 - 211 = 11121201100063 is a prime.
It is a super-2 number, since 2×111212011021112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11121201102113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9251650 + ... + 10384383.
It is an arithmetic number, because the mean of its divisors is an integer number (940173307920).
Almost surely, 211121201102111 is an apocalyptic number.
11121201102111 is a deficient number, since it is larger than the sum of its proper divisors (3921571824609).
11121201102111 is a wasteful number, since it uses less digits than its factorization.
11121201102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19638766.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11121201102111 its reverse (11120110212111), we get a palindrome (22241311314222).
It can be divided in two parts, 11121201 and 102111, that multiplied together give a palindrome (1135596955311).
The spelling of 11121201102111 in words is "eleven trillion, one hundred twenty-one billion, two hundred one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •