Base | Representation |
---|---|
bin | 11101010010000001001… |
… | …000010000110010011111 |
3 | 21010100212110020002022100 |
4 | 131102001020100302133 |
5 | 230432002021340221 |
6 | 4140221431420143 |
7 | 265243316215566 |
oct | 35220110206237 |
9 | 7110773202270 |
10 | 2012211121311 |
11 | 7064127a0a86 |
12 | 285b91524653 |
13 | 11799b378241 |
14 | 6d56a546bdd |
15 | 37520052926 |
hex | 1d481210c9f |
2012211121311 has 48 divisors (see below), whose sum is σ = 3047424307200. Its totient is φ = 1277006898816.
The previous prime is 2012211121267. The next prime is 2012211121331. The reversal of 2012211121311 is 1131211122102.
It is a happy number.
2012211121311 is a `hidden beast` number, since 20 + 1 + 2 + 211 + 121 + 311 = 666.
It is not a de Polignac number, because 2012211121311 - 27 = 2012211121183 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012211121331) 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 47 ways as a sum of consecutive naturals, for example, 281070750 + ... + 281077908.
It is an arithmetic number, because the mean of its divisors is an integer number (63488006400).
Almost surely, 22012211121311 is an apocalyptic number.
2012211121311 is a deficient number, since it is larger than the sum of its proper divisors (1035213185889).
2012211121311 is a wasteful number, since it uses less digits than its factorization.
2012211121311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13500 (or 13497 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 2012211121311 its reverse (1131211122102), we get a palindrome (3143422243413).
The spelling of 2012211121311 in words is "two trillion, twelve billion, two hundred eleven million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •