Base | Representation |
---|---|
bin | 110100100101110111000010… |
… | …001001101011101111111001 |
3 | 1010022222002001211101100020012 |
4 | 310211313002021223233321 |
5 | 220304110132031004011 |
6 | 2135533451402311305 |
7 | 66501611605061111 |
oct | 6445670211535771 |
9 | 1108862054340205 |
10 | 231300131109881 |
11 | 67776920036369 |
12 | 21b37621ab8535 |
13 | 9c0a67ca0c272 |
14 | 4118db3b28041 |
15 | 1bb19a953aa8b |
hex | d25dc226bbf9 |
231300131109881 has 2 divisors, whose sum is σ = 231300131109882. Its totient is φ = 231300131109880.
The previous prime is 231300131109767. The next prime is 231300131110033. The reversal of 231300131109881 is 188901131003132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 124589351041600 + 106710780068281 = 11161960^2 + 10330091^2 .
It is a cyclic number.
It is not a de Polignac number, because 231300131109881 - 210 = 231300131108857 is a prime.
It is a super-3 number, since 3×2313001311098813 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (231300131100881) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115650065554940 + 115650065554941.
It is an arithmetic number, because the mean of its divisors is an integer number (115650065554941).
Almost surely, 2231300131109881 is an apocalyptic number.
It is an amenable number.
231300131109881 is a deficient number, since it is larger than the sum of its proper divisors (1).
231300131109881 is an equidigital number, since it uses as much as digits as its factorization.
231300131109881 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 41.
The spelling of 231300131109881 in words is "two hundred thirty-one trillion, three hundred billion, one hundred thirty-one million, one hundred nine thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •