Base | Representation |
---|---|
bin | 110100100011011011101010… |
… | …110110110110001001011101 |
3 | 1010022101010110210121210222112 |
4 | 310203123222312312021131 |
5 | 220243342004420004203 |
6 | 2135325102113523405 |
7 | 66453554616514631 |
oct | 6443335266661135 |
9 | 1108333423553875 |
10 | 231133310313053 |
11 | 677120a5047635 |
12 | 21b0b225b73565 |
13 | 9bc7a156219b5 |
14 | 4110caa3c4dc1 |
15 | 1bac493d816d8 |
hex | d236eadb625d |
231133310313053 has 2 divisors, whose sum is σ = 231133310313054. Its totient is φ = 231133310313052.
The previous prime is 231133310313041. The next prime is 231133310313127. The reversal of 231133310313053 is 350313013331132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 229019886360409 + 2113423952644 = 15133403^2 + 1453762^2 .
It is a cyclic number.
It is not a de Polignac number, because 231133310313053 - 228 = 231133041877597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231133310313553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115566655156526 + 115566655156527.
It is an arithmetic number, because the mean of its divisors is an integer number (115566655156527).
Almost surely, 2231133310313053 is an apocalyptic number.
It is an amenable number.
231133310313053 is a deficient number, since it is larger than the sum of its proper divisors (1).
231133310313053 is an equidigital number, since it uses as much as digits as its factorization.
231133310313053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21870, while the sum is 32.
Adding to 231133310313053 its reverse (350313013331132), we get a palindrome (581446323644185).
The spelling of 231133310313053 in words is "two hundred thirty-one trillion, one hundred thirty-three billion, three hundred ten million, three hundred thirteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •