Base | Representation |
---|---|
bin | 101100000110111110010… |
… | …101001010011011001010 |
3 | 101201202220201101110101000 |
4 | 230012332111022123022 |
5 | 344130241130144232 |
6 | 10240253332235430 |
7 | 431664413524665 |
oct | 54067625123312 |
9 | 11652821343330 |
10 | 3031145162442 |
11 | a69557471251 |
12 | 40b55846bb76 |
13 | 18cab32291c7 |
14 | a69cb4786dc |
15 | 53ca8b7527c |
hex | 2c1be54a6ca |
3031145162442 has 64 divisors (see below), whose sum is σ = 7160600246400. Its totient is φ = 947726438400.
The previous prime is 3031145162429. The next prime is 3031145162443. The reversal of 3031145162442 is 2442615411303.
3031145162442 is a `hidden beast` number, since 3 + 0 + 3 + 11 + 45 + 162 + 442 = 666.
3031145162442 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 3031145162397 and 3031145162406.
It is not an unprimeable number, because it can be changed into a prime (3031145162443) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14521783 + ... + 14729034.
It is an arithmetic number, because the mean of its divisors is an integer number (111884378850).
Almost surely, 23031145162442 is an apocalyptic number.
3031145162442 is an abundant number, since it is smaller than the sum of its proper divisors (4129455083958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3031145162442 is a wasteful number, since it uses less digits than its factorization.
3031145162442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29250948 (or 29250942 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The spelling of 3031145162442 in words is "three trillion, thirty-one billion, one hundred forty-five million, one hundred sixty-two thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •