Base | Representation |
---|---|
bin | 1001001111011001001000… |
… | …11110110000110000000001 |
3 | 2122221120201212110020212221 |
4 | 10213230210132300300001 |
5 | 10130411032143234103 |
6 | 111114532013451041 |
7 | 4165036035611455 |
oct | 447544436606001 |
9 | 78846655406787 |
10 | 20320102321153 |
11 | 652478601a798 |
12 | 23422091a0a81 |
13 | b4523ca6441b |
14 | 5036d90bc665 |
15 | 25388c2731bd |
hex | 127b247b0c01 |
20320102321153 has 2 divisors, whose sum is σ = 20320102321154. Its totient is φ = 20320102321152.
The previous prime is 20320102321147. The next prime is 20320102321249. The reversal of 20320102321153 is 35112320102302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14514667475344 + 5805434845809 = 3809812^2 + 2409447^2 .
It is a cyclic number.
It is not a de Polignac number, because 20320102321153 - 217 = 20320102190081 is a prime.
It is not a weakly prime, because it can be changed into another prime (20320102421153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10160051160576 + 10160051160577.
It is an arithmetic number, because the mean of its divisors is an integer number (10160051160577).
Almost surely, 220320102321153 is an apocalyptic number.
It is an amenable number.
20320102321153 is a deficient number, since it is larger than the sum of its proper divisors (1).
20320102321153 is an equidigital number, since it uses as much as digits as its factorization.
20320102321153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 20320102321153 its reverse (35112320102302), we get a palindrome (55432422423455).
The spelling of 20320102321153 in words is "twenty trillion, three hundred twenty billion, one hundred two million, three hundred twenty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •