Base | Representation |
---|---|
bin | 110100100100011101110010… |
… | …110101000000111110011111 |
3 | 1010022121220201221221222200121 |
4 | 310210131302311000332133 |
5 | 220301022412104324411 |
6 | 2135421443313135411 |
7 | 66461650234503655 |
oct | 6444356265007637 |
9 | 1108556657858617 |
10 | 231204311011231 |
11 | 6773a21a099a98 |
12 | 21b20b3bb5a567 |
13 | 9c0161c18c23c |
14 | 41144c3c8add5 |
15 | 1bae24c260571 |
hex | d24772d40f9f |
231204311011231 has 2 divisors, whose sum is σ = 231204311011232. Its totient is φ = 231204311011230.
The previous prime is 231204311011139. The next prime is 231204311011379. The reversal of 231204311011231 is 132110113402132.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 231204311011231 - 27 = 231204311011103 is a prime.
It is a super-2 number, since 2×2312043110112312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 231204311011196 and 231204311011205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231204311011831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115602155505615 + 115602155505616.
It is an arithmetic number, because the mean of its divisors is an integer number (115602155505616).
Almost surely, 2231204311011231 is an apocalyptic number.
231204311011231 is a deficient number, since it is larger than the sum of its proper divisors (1).
231204311011231 is an equidigital number, since it uses as much as digits as its factorization.
231204311011231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 231204311011231 its reverse (132110113402132), we get a palindrome (363314424413363).
The spelling of 231204311011231 in words is "two hundred thirty-one trillion, two hundred four billion, three hundred eleven million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •