Base | Representation |
---|---|
bin | 101100011011011011100… |
… | …010110110001001001100 |
3 | 101210212121111100011200200 |
4 | 230123123202312021030 |
5 | 400010232143001012 |
6 | 10254325053453500 |
7 | 433402625605044 |
oct | 54333342661114 |
9 | 11725544304620 |
10 | 3053110125132 |
11 | a778a9086881 |
12 | 4138684a1290 |
13 | 191ba3a31452 |
14 | a7ab26d8724 |
15 | 546421823dc |
hex | 2c6db8b624c |
3053110125132 has 72 divisors (see below), whose sum is σ = 8102537124864. Its totient is φ = 967483240416.
The previous prime is 3053110125119. The next prime is 3053110125139. The reversal of 3053110125132 is 2315210113503.
3053110125132 is a `hidden beast` number, since 3 + 0 + 531 + 1 + 0 + 125 + 1 + 3 + 2 = 666.
3053110125132 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 = 3053110125096 and 3053110125105.
It is not an unprimeable number, because it can be changed into a prime (3053110125139) 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, 11175868 + ... + 11445795.
Almost surely, 23053110125132 is an apocalyptic number.
It is an amenable number.
3053110125132 is an abundant number, since it is smaller than the sum of its proper divisors (5049426999732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3053110125132 is a wasteful number, since it uses less digits than its factorization.
3053110125132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22621859 (or 22621854 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
Adding to 3053110125132 its reverse (2315210113503), we get a palindrome (5368320238635).
The spelling of 3053110125132 in words is "three trillion, fifty-three billion, one hundred ten million, one hundred twenty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •