Base | Representation |
---|---|
bin | 1010000110001010110110… |
… | …1110000000010011110001 |
3 | 1110022020220102222102120010 |
4 | 2201202231232000103301 |
5 | 2423340033130323441 |
6 | 35335440214005133 |
7 | 2224012566122004 |
oct | 241425556002361 |
9 | 43266812872503 |
10 | 11101110011121 |
11 | 359aa55217879 |
12 | 12b35773467a9 |
13 | 626aa3bab0c0 |
14 | 2a5421bbd53b |
15 | 143b730a6116 |
hex | a18adb804f1 |
11101110011121 has 64 divisors (see below), whose sum is σ = 16165911508992. Its totient is φ = 6735020716032.
The previous prime is 11101110011113. The next prime is 11101110011143. The reversal of 11101110011121 is 12111001110111.
It is not a de Polignac number, because 11101110011121 - 23 = 11101110011113 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11101110011097 and 11101110011106.
It is not an unprimeable number, because it can be changed into a prime (11101110011921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4581554716 + ... + 4581557138.
It is an arithmetic number, because the mean of its divisors is an integer number (252592367328).
Almost surely, 211101110011121 is an apocalyptic number.
It is an amenable number.
11101110011121 is a deficient number, since it is larger than the sum of its proper divisors (5064801497871).
11101110011121 is a wasteful number, since it uses less digits than its factorization.
11101110011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4902.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 11101110011121 its reverse (12111001110111), we get a palindrome (23212111121232).
The spelling of 11101110011121 in words is "eleven trillion, one hundred one billion, one hundred ten million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •