Base | Representation |
---|---|
bin | 1110001001101111110100… |
… | …11110011001011101100101 |
3 | 11002012011100202012012021202 |
4 | 13010313322132121131211 |
5 | 13034342300011112013 |
6 | 150104522254452245 |
7 | 6361302230066300 |
oct | 704677236313545 |
9 | 132164322165252 |
10 | 31121240332133 |
11 | 9a09497924a46 |
12 | 35a7608504085 |
13 | 1449949868393 |
14 | 7983c1767b37 |
15 | 38e80534b858 |
hex | 1c4dfa799765 |
31121240332133 has 24 divisors (see below), whose sum is σ = 36219634214400. Its totient is φ = 26662549521888.
The previous prime is 31121240332099. The next prime is 31121240332141. The reversal of 31121240332133 is 33123304212113.
It is not a de Polignac number, because 31121240332133 - 212 = 31121240328037 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 31121240332096 and 31121240332105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31121240332163) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1024822316 + ... + 1024852682.
It is an arithmetic number, because the mean of its divisors is an integer number (1509151425600).
Almost surely, 231121240332133 is an apocalyptic number.
It is an amenable number.
31121240332133 is a deficient number, since it is larger than the sum of its proper divisors (5098393882267).
31121240332133 is a wasteful number, since it uses less digits than its factorization.
31121240332133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39729 (or 39722 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 31121240332133 its reverse (33123304212113), we get a palindrome (64244544544246).
The spelling of 31121240332133 in words is "thirty-one trillion, one hundred twenty-one billion, two hundred forty million, three hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •