Base | Representation |
---|---|
bin | 11111010101001011010… |
… | …001100111001010000001 |
3 | 21121211101011110202110211 |
4 | 133111023101213022001 |
5 | 240233412112221304 |
6 | 4325032115554121 |
7 | 311360242663204 |
oct | 37251321471201 |
9 | 7554334422424 |
10 | 2153041523329 |
11 | 7601108a0484 |
12 | 2a93352bb941 |
13 | 128052ca6078 |
14 | 762ca17593b |
15 | 3b013b04204 |
hex | 1f54b467281 |
2153041523329 has 2 divisors, whose sum is σ = 2153041523330. Its totient is φ = 2153041523328.
The previous prime is 2153041523293. The next prime is 2153041523359. The reversal of 2153041523329 is 9233251403512.
It is a happy number.
Together with previous prime (2153041523293) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1430949465729 + 722092057600 = 1196223^2 + 849760^2 .
It is a cyclic number.
It is not a de Polignac number, because 2153041523329 - 29 = 2153041522817 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2153041523291 and 2153041523300.
It is not a weakly prime, because it can be changed into another prime (2153041523359) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1076520761664 + 1076520761665.
It is an arithmetic number, because the mean of its divisors is an integer number (1076520761665).
Almost surely, 22153041523329 is an apocalyptic number.
It is an amenable number.
2153041523329 is a deficient number, since it is larger than the sum of its proper divisors (1).
2153041523329 is an equidigital number, since it uses as much as digits as its factorization.
2153041523329 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 194400, while the sum is 40.
The spelling of 2153041523329 in words is "two trillion, one hundred fifty-three billion, forty-one million, five hundred twenty-three thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •