Base | Representation |
---|---|
bin | 110100101001010000010011… |
… | …010000101111110101111101 |
3 | 1010100210101020010212111010122 |
4 | 310221100103100233311331 |
5 | 220321420421024301031 |
6 | 2140232552420144325 |
7 | 66524510664151454 |
oct | 6451202320576575 |
9 | 1110711203774118 |
10 | 231533420150141 |
11 | 6785685467a18a |
12 | 21b74889b380a5 |
13 | 9c2667a9391a5 |
14 | 41263c4db9b9b |
15 | 1bb7ab022447b |
hex | d2941342fd7d |
231533420150141 has 2 divisors, whose sum is σ = 231533420150142. Its totient is φ = 231533420150140.
The previous prime is 231533420150113. The next prime is 231533420150159. The reversal of 231533420150141 is 141051024335132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 204588081158041 + 26945338992100 = 14303429^2 + 5190890^2 .
It is a cyclic number.
It is not a de Polignac number, because 231533420150141 - 234 = 231516240280957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231533420150171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115766710075070 + 115766710075071.
It is an arithmetic number, because the mean of its divisors is an integer number (115766710075071).
Almost surely, 2231533420150141 is an apocalyptic number.
It is an amenable number.
231533420150141 is a deficient number, since it is larger than the sum of its proper divisors (1).
231533420150141 is an equidigital number, since it uses as much as digits as its factorization.
231533420150141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 231533420150141 its reverse (141051024335132), we get a palindrome (372584444485273).
The spelling of 231533420150141 in words is "two hundred thirty-one trillion, five hundred thirty-three billion, four hundred twenty million, one hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •