Base | Representation |
---|---|
bin | 10010101111010011… |
… | …100100010001101111 |
3 | 1220221021020021120011 |
4 | 102233103210101233 |
5 | 312201434330221 |
6 | 13124331034051 |
7 | 1311421526362 |
oct | 225723442157 |
9 | 56837207504 |
10 | 20121011311 |
11 | 8595871675 |
12 | 3a9659b927 |
13 | 1b88796c6b |
14 | d8c3c60d9 |
15 | 7cb6c11e1 |
hex | 4af4e446f |
20121011311 has 16 divisors (see below), whose sum is σ = 21004075008. Its totient is φ = 19253404800.
The previous prime is 20121011291. The next prime is 20121011327. The reversal of 20121011311 is 11311012102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20121011311 - 29 = 20121010799 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20121011291 and 20121011300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121011411) 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 15 ways as a sum of consecutive naturals, for example, 1503130 + ... + 1516456.
It is an arithmetic number, because the mean of its divisors is an integer number (1312754688).
Almost surely, 220121011311 is an apocalyptic number.
20121011311 is a deficient number, since it is larger than the sum of its proper divisors (883063697).
20121011311 is a wasteful number, since it uses less digits than its factorization.
20121011311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13902.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 20121011311 its reverse (11311012102), we get a palindrome (31432023413).
It can be divided in two parts, 201210 and 11311, that added together give a square (212521 = 4612).
The spelling of 20121011311 in words is "twenty billion, one hundred twenty-one million, eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •