Base | Representation |
---|---|
bin | 110100100110010011000100… |
… | …111101100101001100011111 |
3 | 1010100001221210101021212220102 |
4 | 310212103010331211030133 |
5 | 220310103314204240111 |
6 | 2135555351353411315 |
7 | 66504026034210662 |
oct | 6446230475451437 |
9 | 1110057711255812 |
10 | 231330243040031 |
11 | 6778867247a153 |
12 | 21b41426409b3b |
13 | 9c1046b334105 |
14 | 411a62cd8b6d9 |
15 | 1bb266cdc413b |
hex | d264c4f6531f |
231330243040031 has 2 divisors, whose sum is σ = 231330243040032. Its totient is φ = 231330243040030.
The previous prime is 231330243040021. The next prime is 231330243040051. The reversal of 231330243040031 is 130040342033132.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 231330243040031 - 230 = 231329169298207 is a prime.
It is a super-2 number, since 2×2313302430400312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 231330243039976 and 231330243040003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231330243040021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115665121520015 + 115665121520016.
It is an arithmetic number, because the mean of its divisors is an integer number (115665121520016).
Almost surely, 2231330243040031 is an apocalyptic number.
231330243040031 is a deficient number, since it is larger than the sum of its proper divisors (1).
231330243040031 is an equidigital number, since it uses as much as digits as its factorization.
231330243040031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 231330243040031 its reverse (130040342033132), we get a palindrome (361370585073163).
The spelling of 231330243040031 in words is "two hundred thirty-one trillion, three hundred thirty billion, two hundred forty-three million, forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •