Base | Representation |
---|---|
bin | 11101010011000011001… |
… | …110111000100011101001 |
3 | 21010110201202001202012222 |
4 | 131103003032320203221 |
5 | 230441234424401241 |
6 | 4140523450043425 |
7 | 265312643640221 |
oct | 35230316704351 |
9 | 7113652052188 |
10 | 2013320153321 |
11 | 706931815164 |
12 | 286240a19575 |
13 | 117b1706bcb9 |
14 | 6d633957081 |
15 | 375875bea4b |
hex | 1d4c33b88e9 |
2013320153321 has 2 divisors, whose sum is σ = 2013320153322. Its totient is φ = 2013320153320.
The previous prime is 2013320153279. The next prime is 2013320153323. The reversal of 2013320153321 is 1233510233102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1734657580096 + 278662573225 = 1317064^2 + 527885^2 .
It is a cyclic number.
It is not a de Polignac number, because 2013320153321 - 210 = 2013320152297 is a prime.
It is a Sophie Germain prime.
Together with 2013320153323, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2013320153323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006660076660 + 1006660076661.
It is an arithmetic number, because the mean of its divisors is an integer number (1006660076661).
Almost surely, 22013320153321 is an apocalyptic number.
It is an amenable number.
2013320153321 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013320153321 is an equidigital number, since it uses as much as digits as its factorization.
2013320153321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 2013320153321 its reverse (1233510233102), we get a palindrome (3246830386423).
The spelling of 2013320153321 in words is "two trillion, thirteen billion, three hundred twenty million, one hundred fifty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •