Base | Representation |
---|---|
bin | 11101010001000000001… |
… | …110000001001001111101 |
3 | 21010021001120001122010212 |
4 | 131101000032001021331 |
5 | 230422234230023401 |
6 | 4135521410242205 |
7 | 265204323613655 |
oct | 35210016011175 |
9 | 7107046048125 |
10 | 2011122111101 |
11 | 705a04002544 |
12 | 285928886365 |
13 | 1178568747bc |
14 | 6d4a5a69365 |
15 | 374a963cdbb |
hex | 1d44038127d |
2011122111101 has 16 divisors (see below), whose sum is σ = 2222085913344. Its totient is φ = 1810459985664.
The previous prime is 2011122111091. The next prime is 2011122111133. The reversal of 2011122111101 is 1011112211102.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011122111101 is a prime.
It is a super-2 number, since 2×20111221111012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011122111151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13535651 + ... + 13683423.
It is an arithmetic number, because the mean of its divisors is an integer number (138880369584).
Almost surely, 22011122111101 is an apocalyptic number.
It is an amenable number.
2011122111101 is a deficient number, since it is larger than the sum of its proper divisors (210963802243).
2011122111101 is a wasteful number, since it uses less digits than its factorization.
2011122111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182620.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 2011122111101 its reverse (1011112211102), we get a palindrome (3022234322203).
The spelling of 2011122111101 in words is "two trillion, eleven billion, one hundred twenty-two million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •