Base | Representation |
---|---|
bin | 110100100011000110000101… |
… | …011001001100000000110101 |
3 | 1010022021220122112210122001222 |
4 | 310203012011121030000311 |
5 | 220243002023044443442 |
6 | 2135310310212000125 |
7 | 66452104355364326 |
oct | 6443060531140065 |
9 | 1108256575718058 |
10 | 231110133202997 |
11 | 67703291189824 |
12 | 21b06838000045 |
13 | 9bc57909611a9 |
14 | 410db0c19244d |
15 | 1baba892398d2 |
hex | d2318564c035 |
231110133202997 has 2 divisors, whose sum is σ = 231110133202998. Its totient is φ = 231110133202996.
The previous prime is 231110133202891. The next prime is 231110133203039. The reversal of 231110133202997 is 799202331011132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 222952260475396 + 8157872727601 = 14931586^2 + 2856199^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-231110133202997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231110133202297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115555066601498 + 115555066601499.
It is an arithmetic number, because the mean of its divisors is an integer number (115555066601499).
Almost surely, 2231110133202997 is an apocalyptic number.
It is an amenable number.
231110133202997 is a deficient number, since it is larger than the sum of its proper divisors (1).
231110133202997 is an equidigital number, since it uses as much as digits as its factorization.
231110133202997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122472, while the sum is 44.
The spelling of 231110133202997 in words is "two hundred thirty-one trillion, one hundred ten billion, one hundred thirty-three million, two hundred two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •