Base | Representation |
---|---|
bin | 11101010001000000001… |
… | …001110010001011111011 |
3 | 21010021001110222020122211 |
4 | 131101000021302023323 |
5 | 230422233434014321 |
6 | 4135521330355551 |
7 | 265204311312100 |
oct | 35210011621373 |
9 | 7107043866584 |
10 | 2011121001211 |
11 | 705a03414683 |
12 | 28592842bbb7 |
13 | 11785657656a |
14 | 6d4a585aaa7 |
15 | 374a94be0e1 |
hex | 1d4402722fb |
2011121001211 has 6 divisors (see below), whose sum is σ = 2339467287180. Its totient is φ = 1723818000996.
The previous prime is 2011121001083. The next prime is 2011121001271. The reversal of 2011121001211 is 1121001211102.
It is a happy number.
It is not a de Polignac number, because 2011121001211 - 27 = 2011121001083 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011121001191 and 2011121001200.
It is not an unprimeable number, because it can be changed into a prime (2011121001271) 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 5 ways as a sum of consecutive naturals, for example, 20521642821 + ... + 20521642918.
It is an arithmetic number, because the mean of its divisors is an integer number (389911214530).
Almost surely, 22011121001211 is an apocalyptic number.
2011121001211 is a deficient number, since it is larger than the sum of its proper divisors (328346285969).
2011121001211 is an equidigital number, since it uses as much as digits as its factorization.
2011121001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41043285753 (or 41043285746 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2011121001211 its reverse (1121001211102), we get a palindrome (3132122212313).
The spelling of 2011121001211 in words is "two trillion, eleven billion, one hundred twenty-one million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •