Base | Representation |
---|---|
bin | 1110001001011011010100… |
… | …10100111111010011100000 |
3 | 11002011002221120002120222021 |
4 | 13010231222110333103200 |
5 | 13034202223343341000 |
6 | 150055502052151224 |
7 | 6360432356651431 |
oct | 704555224772340 |
9 | 132132846076867 |
10 | 31110232012000 |
11 | 9a04858a24109 |
12 | 35a5455908514 |
13 | 14488b3cb999b |
14 | 797a5972d488 |
15 | 38e3adbb711a |
hex | 1c4b6a53f4e0 |
31110232012000 has 96 divisors (see below), whose sum is σ = 77733397254240. Its totient is φ = 12233175884800.
The previous prime is 31110232011931. The next prime is 31110232012007. The reversal of 31110232012000 is 21023201113.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31110232012007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65675509 + ... + 66147508.
It is an arithmetic number, because the mean of its divisors is an integer number (809722888065).
Almost surely, 231110232012000 is an apocalyptic number.
It is an amenable number.
31110232012000 is an abundant number, since it is smaller than the sum of its proper divisors (46623165242240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31110232012000 is a wasteful number, since it uses less digits than its factorization.
31110232012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131823101 (or 131823083 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 31110232012000 its reverse (21023201113), we get a palindrome (31131255213113).
The spelling of 31110232012000 in words is "thirty-one trillion, one hundred ten billion, two hundred thirty-two million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •