Base | Representation |
---|---|
bin | 1001001111011001001011… |
… | …00011000000111101001001 |
3 | 2122221120210010010021022211 |
4 | 10213230211203000331021 |
5 | 10130411101233311241 |
6 | 111114533453145121 |
7 | 4165036343651305 |
oct | 447544543007511 |
9 | 78846703107284 |
10 | 20320120213321 |
11 | 6524795130405 |
12 | 234221318b1a1 |
13 | b4524368a2c6 |
14 | 5036db618d05 |
15 | 25388db09781 |
hex | 127b258c0f49 |
20320120213321 has 2 divisors, whose sum is σ = 20320120213322. Its totient is φ = 20320120213320.
The previous prime is 20320120213303. The next prime is 20320120213331. The reversal of 20320120213321 is 12331202102302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20294475393721 + 25644819600 = 4504939^2 + 160140^2 .
It is a cyclic number.
It is not a de Polignac number, because 20320120213321 - 233 = 20311530278729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20320120213292 and 20320120213301.
It is not a weakly prime, because it can be changed into another prime (20320120213331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10160060106660 + 10160060106661.
It is an arithmetic number, because the mean of its divisors is an integer number (10160060106661).
Almost surely, 220320120213321 is an apocalyptic number.
It is an amenable number.
20320120213321 is a deficient number, since it is larger than the sum of its proper divisors (1).
20320120213321 is an equidigital number, since it uses as much as digits as its factorization.
20320120213321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 20320120213321 its reverse (12331202102302), we get a palindrome (32651322315623).
The spelling of 20320120213321 in words is "twenty trillion, three hundred twenty billion, one hundred twenty million, two hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •