Base | Representation |
---|---|
bin | 110100101001010000010100… |
… | …000101100110001111011001 |
3 | 1010100210101021002221100122212 |
4 | 310221100110011212033121 |
5 | 220321420433101120231 |
6 | 2140232554033124505 |
7 | 66524511223003142 |
oct | 6451202405461731 |
9 | 1110711232840585 |
10 | 231533434004441 |
11 | 67856861482118 |
12 | 21b748926b9735 |
13 | 9c2668077a1ba |
14 | 41263c6b84ac9 |
15 | 1bb7ab155e42b |
hex | d294141663d9 |
231533434004441 has 2 divisors, whose sum is σ = 231533434004442. Its totient is φ = 231533434004440.
The previous prime is 231533434004419. The next prime is 231533434004447. The reversal of 231533434004441 is 144400434335132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 231362200254025 + 171233750416 = 15210595^2 + 413804^2 .
It is a cyclic number.
It is not a de Polignac number, because 231533434004441 - 230 = 231532360262617 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (231533434004447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115766717002220 + 115766717002221.
It is an arithmetic number, because the mean of its divisors is an integer number (115766717002221).
Almost surely, 2231533434004441 is an apocalyptic number.
It is an amenable number.
231533434004441 is a deficient number, since it is larger than the sum of its proper divisors (1).
231533434004441 is an equidigital number, since it uses as much as digits as its factorization.
231533434004441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 829440, while the sum is 41.
Adding to 231533434004441 its reverse (144400434335132), we get a palindrome (375933868339573).
The spelling of 231533434004441 in words is "two hundred thirty-one trillion, five hundred thirty-three billion, four hundred thirty-four million, four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •