Base | Representation |
---|---|
bin | 1110000110100010101111… |
… | …00100010000100101000000 |
3 | 11001210122011011211011220111 |
4 | 13003101113210100211000 |
5 | 13031041300022000000 |
6 | 145542152352321104 |
7 | 6350323533155206 |
oct | 703212744204500 |
9 | 131718134734814 |
10 | 31011133000000 |
11 | 997682513569a |
12 | 358a1b9843194 |
13 | 143c45005b54a |
14 | 792d38205076 |
15 | 38ba0db01cba |
hex | 1c3457910940 |
31011133000000 has 196 divisors, whose sum is σ = 77131668952000. Its totient is φ = 12370507200000.
The previous prime is 31011132999971. The next prime is 31011133000019. The reversal of 31011133000000 is 33111013.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 366957751 + ... + 367042249.
Almost surely, 231011133000000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31011133000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38565834476000).
31011133000000 is an abundant number, since it is smaller than the sum of its proper divisors (46120535952000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31011133000000 is an frugal number, since it uses more digits than its factorization.
31011133000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84908 (or 84873 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 31011133000000 its reverse (33111013), we get a palindrome (31011166111013).
The spelling of 31011133000000 in words is "thirty-one trillion, eleven billion, one hundred thirty-three million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •