Base | Representation |
---|---|
bin | 1110000110100011000101… |
… | …11010001111011110001010 |
3 | 11001210122122102221000220110 |
4 | 13003101202322033132022 |
5 | 13031042142231441020 |
6 | 145542223311335150 |
7 | 6350331333612546 |
oct | 703214272173612 |
9 | 131718572830813 |
10 | 31011323312010 |
11 | 9976912600948 |
12 | 358a2515214b6 |
13 | 143c480602cc2 |
14 | 792d555c4a26 |
15 | 38ba206958e0 |
hex | 1c3462e8f78a |
31011323312010 has 64 divisors (see below), whose sum is σ = 77840050083840. Its totient is φ = 7892116034880.
The previous prime is 31011323312009. The next prime is 31011323312017. The reversal of 31011323312010 is 1021332311013.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (31011323312017) 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 31 ways as a sum of consecutive naturals, for example, 50886096 + ... + 51491915.
It is an arithmetic number, because the mean of its divisors is an integer number (1216250782560).
Almost surely, 231011323312010 is an apocalyptic number.
31011323312010 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31011323312010 is an abundant number, since it is smaller than the sum of its proper divisors (46828726771830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31011323312010 is a wasteful number, since it uses less digits than its factorization.
31011323312010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102378483.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 31011323312010 its reverse (1021332311013), we get a palindrome (32032655623023).
The spelling of 31011323312010 in words is "thirty-one trillion, eleven billion, three hundred twenty-three million, three hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •