Base | Representation |
---|---|
bin | 1110000111001000010110… |
… | …11101100110010100011110 |
3 | 11001212120021210222000102110 |
4 | 13003210023131212110132 |
5 | 13031404131220201420 |
6 | 145555332514134450 |
7 | 6351640211421066 |
oct | 703441335462436 |
9 | 131776253860373 |
10 | 31031331022110 |
11 | 998434a416651 |
12 | 35920b5b81426 |
13 | 144131b77a113 |
14 | 793cd29163a6 |
15 | 38c2e1e35ee0 |
hex | 1c390b76651e |
31031331022110 has 64 divisors (see below), whose sum is σ = 74568784435200. Its totient is φ = 8264627354880.
The previous prime is 31031331022079. The next prime is 31031331022117. The reversal of 31031331022110 is 1122013313013.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31031331022117) 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, 108663291 + ... + 108948489.
It is an arithmetic number, because the mean of its divisors is an integer number (1165137256800).
Almost surely, 231031331022110 is an apocalyptic number.
31031331022110 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31031331022110 is an abundant number, since it is smaller than the sum of its proper divisors (43537453413090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31031331022110 is a wasteful number, since it uses less digits than its factorization.
31031331022110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289753.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 31031331022110 its reverse (1122013313013), we get a palindrome (32153344335123).
The spelling of 31031331022110 in words is "thirty-one trillion, thirty-one billion, three hundred thirty-one million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •