Base | Representation |
---|---|
bin | 1110001001101101100011… |
… | …11011001001011101111110 |
3 | 11002012001012220211000122110 |
4 | 13010312301323021131332 |
5 | 13034332301410211110 |
6 | 150104201413554450 |
7 | 6361230120053040 |
oct | 704666173113576 |
9 | 132161186730573 |
10 | 31120023132030 |
11 | 9a08a22840548 |
12 | 35a7328945a26 |
13 | 14497b4631031 |
14 | 798307c3ba90 |
15 | 38e783564a20 |
hex | 1c4db1ec977e |
31120023132030 has 64 divisors (see below), whose sum is σ = 85358399270400. Its totient is φ = 7113096349824.
The previous prime is 31120023132001. The next prime is 31120023132091. The reversal of 31120023132030 is 3023132002113.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 31120023131988 and 31120023132006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33457696 + ... + 34375244.
It is an arithmetic number, because the mean of its divisors is an integer number (1333724988600).
Almost surely, 231120023132030 is an apocalyptic number.
31120023132030 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31120023132030 is an abundant number, since it is smaller than the sum of its proper divisors (54238376138370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31120023132030 is a wasteful number, since it uses less digits than its factorization.
31120023132030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1079073.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 31120023132030 its reverse (3023132002113), we get a palindrome (34143155134143).
The spelling of 31120023132030 in words is "thirty-one trillion, one hundred twenty billion, twenty-three million, one hundred thirty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •