Base | Representation |
---|---|
bin | 1001001111011100101100… |
… | …11000100100111000011101 |
3 | 2122221202200001022011012111 |
4 | 10213232112120210320131 |
5 | 10130423440401133201 |
6 | 111115445400434021 |
7 | 4165134301645204 |
oct | 447562630447035 |
9 | 78852601264174 |
10 | 20322013302301 |
11 | 6525576796157 |
12 | 2342661178911 |
13 | b454859412b9 |
14 | 50383ac0423b |
15 | 25394edeeb51 |
hex | 127b96624e1d |
20322013302301 has 2 divisors, whose sum is σ = 20322013302302. Its totient is φ = 20322013302300.
The previous prime is 20322013302127. The next prime is 20322013302307. The reversal of 20322013302301 is 10320331022302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19377375096676 + 944638205625 = 4401974^2 + 971925^2 .
It is a cyclic number.
It is not a de Polignac number, because 20322013302301 - 221 = 20322011205149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20322013302307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10161006651150 + 10161006651151.
It is an arithmetic number, because the mean of its divisors is an integer number (10161006651151).
Almost surely, 220322013302301 is an apocalyptic number.
It is an amenable number.
20322013302301 is a deficient number, since it is larger than the sum of its proper divisors (1).
20322013302301 is an equidigital number, since it uses as much as digits as its factorization.
20322013302301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 20322013302301 its reverse (10320331022302), we get a palindrome (30642344324603).
The spelling of 20322013302301 in words is "twenty trillion, three hundred twenty-two billion, thirteen million, three hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •