Base | Representation |
---|---|
bin | 11101010001000101100… |
… | …101011000011110011011 |
3 | 21010021021211102122220021 |
4 | 131101011211120132123 |
5 | 230422430300401021 |
6 | 4135534343411311 |
7 | 265206465653311 |
oct | 35210545303633 |
9 | 7107254378807 |
10 | 2011212122011 |
11 | 705a4a8a1024 |
12 | 285952a53b37 |
13 | 11786c3cb6b1 |
14 | 6d4b39ba0b1 |
15 | 374b24bcc41 |
hex | 1d44595879b |
2011212122011 has 2 divisors, whose sum is σ = 2011212122012. Its totient is φ = 2011212122010.
The previous prime is 2011212121999. The next prime is 2011212122027. The reversal of 2011212122011 is 1102212121102.
It is an a-pointer prime, because the next prime (2011212122027) can be obtained adding 2011212122011 to its sum of digits (16).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2011212122011 - 211 = 2011212119963 is a prime.
It is not a weakly prime, because it can be changed into another prime (2011212122071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005606061005 + 1005606061006.
It is an arithmetic number, because the mean of its divisors is an integer number (1005606061006).
Almost surely, 22011212122011 is an apocalyptic number.
2011212122011 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011212122011 is an equidigital number, since it uses as much as digits as its factorization.
2011212122011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 2011212122011 its reverse (1102212121102), we get a palindrome (3113424243113).
Subtracting from 2011212122011 its reverse (1102212121102), we obtain a palindrome (909000000909).
The spelling of 2011212122011 in words is "two trillion, eleven billion, two hundred twelve million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •