Base | Representation |
---|---|
bin | 101100000111000010001… |
… | …100101101100111000100 |
3 | 101201210002020111101210000 |
4 | 230013002030231213010 |
5 | 344130404233244012 |
6 | 10240304011201300 |
7 | 431666132233266 |
oct | 54070214554704 |
9 | 11653066441700 |
10 | 3031210056132 |
11 | a695900648a5 |
12 | 40b576146230 |
13 | 18cac37ca73b |
14 | a69d5d2bb36 |
15 | 53cae6e2ddc |
hex | 2c1c232d9c4 |
3031210056132 has 60 divisors (see below), whose sum is σ = 7924351002876. Its totient is φ = 1010381783040.
The previous prime is 3031210056109. The next prime is 3031210056151. The reversal of 3031210056132 is 2316500121303.
3031210056132 is a `hidden beast` number, since 3 + 0 + 31 + 2 + 10 + 0 + 5 + 613 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 2945253198276 + 85956857856 = 1716174^2 + 293184^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 3031210056096 and 3031210056105.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 24250948 + ... + 24375620.
Almost surely, 23031210056132 is an apocalyptic number.
It is an amenable number.
3031210056132 is an abundant number, since it is smaller than the sum of its proper divisors (4893140946744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3031210056132 is a wasteful number, since it uses less digits than its factorization.
3031210056132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 199730 (or 199719 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
Adding to 3031210056132 its reverse (2316500121303), we get a palindrome (5347710177435).
The spelling of 3031210056132 in words is "three trillion, thirty-one billion, two hundred ten million, fifty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •