Base | Representation |
---|---|
bin | 110100100011011010101001… |
… | …010110100100000010001011 |
3 | 1010022101000122012200202022100 |
4 | 310203122221112210002023 |
5 | 220243332232100044321 |
6 | 2135324401054524443 |
7 | 66453515443362141 |
oct | 6443325126440213 |
9 | 1108330565622270 |
10 | 231132211331211 |
11 | 67711690768283 |
12 | 21b0ab79b06723 |
13 | 9bc789ba39598 |
14 | 4110c0446d591 |
15 | 1bac42c64c326 |
hex | d236a95a408b |
231132211331211 has 12 divisors (see below), whose sum is σ = 341621769720088. Its totient is φ = 150504695750304.
The previous prime is 231132211331179. The next prime is 231132211331261. The reversal of 231132211331211 is 112133112231132.
231132211331211 is a `hidden beast` number, since 2 + 3 + 1 + 1 + 322 + 1 + 1 + 331 + 2 + 1 + 1 = 666.
It is not a de Polignac number, because 231132211331211 - 25 = 231132211331179 is a prime.
It is a super-2 number, since 2×2311322113312112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (231132211331261) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 298620427690 + ... + 298620428463.
Almost surely, 2231132211331211 is an apocalyptic number.
231132211331211 is a deficient number, since it is larger than the sum of its proper divisors (110489558388877).
231132211331211 is a wasteful number, since it uses less digits than its factorization.
231132211331211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 597240856202 (or 597240856199 counting only the distinct ones).
The product of its digits is 1296, while the sum is 27.
Adding to 231132211331211 its reverse (112133112231132), we get a palindrome (343265323562343).
The spelling of 231132211331211 in words is "two hundred thirty-one trillion, one hundred thirty-two billion, two hundred eleven million, three hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •