Base | Representation |
---|---|
bin | 101101010010011101101… |
… | …001001001010001100111 |
3 | 102000112010122111022001200 |
4 | 231102131221021101213 |
5 | 401442241442143421 |
6 | 10341420411053543 |
7 | 440564150064312 |
oct | 55223551112147 |
9 | 12015118438050 |
10 | 3112201131111 |
11 | a9a971449206 |
12 | 4231b9a412b3 |
13 | 197630066247 |
14 | aa8ba56d979 |
15 | 55e4ebcd726 |
hex | 2d49da49467 |
3112201131111 has 48 divisors (see below), whose sum is σ = 4755812894976. Its totient is φ = 1957117396608.
The previous prime is 3112201131103. The next prime is 3112201131163. The reversal of 3112201131111 is 1111311022113.
3112201131111 is a `hidden beast` number, since 311 + 2 + 20 + 11 + 311 + 11 = 666.
3112201131111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3112201131111 - 23 = 3112201131103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3112201132111) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 154771920 + ... + 154792026.
It is an arithmetic number, because the mean of its divisors is an integer number (99079435312).
Almost surely, 23112201131111 is an apocalyptic number.
3112201131111 is a deficient number, since it is larger than the sum of its proper divisors (1643611763865).
3112201131111 is a wasteful number, since it uses less digits than its factorization.
3112201131111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30452 (or 30449 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 3112201131111 its reverse (1111311022113), we get a palindrome (4223512153224).
The spelling of 3112201131111 in words is "three trillion, one hundred twelve billion, two hundred one million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •