Base | Representation |
---|---|
bin | 1110001010000110010110… |
… | …00101101000100101011011 |
3 | 11002020022120022102210022000 |
4 | 13011003023011220211123 |
5 | 13040042030013310321 |
6 | 150114242054532043 |
7 | 6362210642302062 |
oct | 705031305504533 |
9 | 132208508383260 |
10 | 31133330213211 |
11 | 9a136312965a6 |
12 | 35a9a21367023 |
13 | 144ab2550c975 |
14 | 798c0b2a11d9 |
15 | 38ecb1923826 |
hex | 1c50cb16895b |
31133330213211 has 32 divisors (see below), whose sum is σ = 49454781235200. Its totient is φ = 19287364636800.
The previous prime is 31133330213207. The next prime is 31133330213221. The reversal of 31133330213211 is 11231203333113.
31133330213211 is a `hidden beast` number, since 3 + 1 + 1 + 3 + 3 + 330 + 2 + 1 + 321 + 1 = 666.
It is not a de Polignac number, because 31133330213211 - 22 = 31133330213207 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (31133330213221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 429258715 + ... + 429331236.
It is an arithmetic number, because the mean of its divisors is an integer number (1545461913600).
Almost surely, 231133330213211 is an apocalyptic number.
31133330213211 is a deficient number, since it is larger than the sum of its proper divisors (18321451021989).
31133330213211 is a wasteful number, since it uses less digits than its factorization.
31133330213211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 858590056 (or 858590050 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 27.
Adding to 31133330213211 its reverse (11231203333113), we get a palindrome (42364533546324).
The spelling of 31133330213211 in words is "thirty-one trillion, one hundred thirty-three billion, three hundred thirty million, two hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •