Base | Representation |
---|---|
bin | 1101011101011001110… |
… | …0101110011010000111 |
3 | 211002211220011000102202 |
4 | 3113112130232122013 |
5 | 12242030131333111 |
6 | 254120501225115 |
7 | 22464060046001 |
oct | 3272634563207 |
9 | 732756130382 |
10 | 231231121031 |
11 | 8a078a37729 |
12 | 38992a0219b |
13 | 18a60783a51 |
14 | b297c3b371 |
15 | 60351d4b3b |
hex | 35d672e687 |
231231121031 has 2 divisors, whose sum is σ = 231231121032. Its totient is φ = 231231121030.
The previous prime is 231231121013. The next prime is 231231121117. The reversal of 231231121031 is 130121132132.
It is a happy number.
Together with previous prime (231231121013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-231231121031 is a prime.
It is a super-2 number, since 2×2312311210312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 231231120994 and 231231121012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231231121001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115615560515 + 115615560516.
It is an arithmetic number, because the mean of its divisors is an integer number (115615560516).
Almost surely, 2231231121031 is an apocalyptic number.
231231121031 is a deficient number, since it is larger than the sum of its proper divisors (1).
231231121031 is an equidigital number, since it uses as much as digits as its factorization.
231231121031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 231231121031 its reverse (130121132132), we get a palindrome (361352253163).
The spelling of 231231121031 in words is "two hundred thirty-one billion, two hundred thirty-one million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •