Base | Representation |
---|---|
bin | 11101010000001001111… |
… | …010011100111000001111 |
3 | 21010011201001200000021211 |
4 | 131100021322130320033 |
5 | 230413403004341421 |
6 | 4135251142235251 |
7 | 265142621450461 |
oct | 35201172347017 |
9 | 7104631600254 |
10 | 2010211012111 |
11 | 70558678a375 |
12 | 285713725b27 |
13 | 11773cb93283 |
14 | 6d41aa60131 |
15 | 3745466c9e1 |
hex | 1d409e9ce0f |
2010211012111 has 2 divisors, whose sum is σ = 2010211012112. Its totient is φ = 2010211012110.
The previous prime is 2010211012057. The next prime is 2010211012189. The reversal of 2010211012111 is 1112101120102.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2010211012111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2010211012091 and 2010211012100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2010211012811) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005105506055 + 1005105506056.
It is an arithmetic number, because the mean of its divisors is an integer number (1005105506056).
Almost surely, 22010211012111 is an apocalyptic number.
2010211012111 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010211012111 is an equidigital number, since it uses as much as digits as its factorization.
2010211012111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2010211012111 its reverse (1112101120102), we get a palindrome (3122312132213).
The spelling of 2010211012111 in words is "two trillion, ten billion, two hundred eleven million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •