Base | Representation |
---|---|
bin | 101011110100010100001… |
… | …101011001011111111011 |
3 | 101122212012111211012221100 |
4 | 223310110031121133323 |
5 | 343313223422144011 |
6 | 10223141345342443 |
7 | 430355066212305 |
oct | 53642415313773 |
9 | 11585174735840 |
10 | 3011111131131 |
11 | a61006808a84 |
12 | 4076a7037a23 |
13 | 18ac3c7976cc |
14 | a5a4a854975 |
15 | 534d4e35d56 |
hex | 2bd143597fb |
3011111131131 has 24 divisors (see below), whose sum is σ = 4352802277824. Its totient is φ = 2005829575920.
The previous prime is 3011111131109. The next prime is 3011111131139. The reversal of 3011111131131 is 1311311111103.
3011111131131 is a `hidden beast` number, since 301 + 1 + 11 + 11 + 311 + 31 = 666.
It is not a de Polignac number, because 3011111131131 - 29 = 3011111130619 is a prime.
It is a super-3 number, since 3×30111111311313 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (3011111131139) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 134973880 + ... + 134996186.
It is an arithmetic number, because the mean of its divisors is an integer number (181366761576).
Almost surely, 23011111131131 is an apocalyptic number.
3011111131131 is a deficient number, since it is larger than the sum of its proper divisors (1341691146693).
3011111131131 is a wasteful number, since it uses less digits than its factorization.
3011111131131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33431 (or 33428 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 18.
Adding to 3011111131131 its reverse (1311311111103), we get a palindrome (4322422242234).
The spelling of 3011111131131 in words is "three trillion, eleven billion, one hundred eleven million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •