Base | Representation |
---|---|
bin | 1001001111011100101101… |
… | …10010111011101001100101 |
3 | 2122221202200112022011120101 |
4 | 10213232112302323221211 |
5 | 10130423444133230201 |
6 | 111115450204504101 |
7 | 4165134414452104 |
oct | 447562662735145 |
9 | 78852615264511 |
10 | 20322020211301 |
11 | 652557a684a76 |
12 | 234266354b031 |
13 | b454871bcc73 |
14 | 50383bac203b |
15 | 253950816d01 |
hex | 127b96cbba65 |
20322020211301 has 2 divisors, whose sum is σ = 20322020211302. Its totient is φ = 20322020211300.
The previous prime is 20322020211281. The next prime is 20322020211323. The reversal of 20322020211301 is 10311202022302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10422250179201 + 9899770032100 = 3228351^2 + 3146390^2 .
It is a cyclic number.
It is not a de Polignac number, because 20322020211301 - 231 = 20319872727653 is a prime.
It is a super-2 number, since 2×203220202113012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20322020211601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10161010105650 + 10161010105651.
It is an arithmetic number, because the mean of its divisors is an integer number (10161010105651).
Almost surely, 220322020211301 is an apocalyptic number.
It is an amenable number.
20322020211301 is a deficient number, since it is larger than the sum of its proper divisors (1).
20322020211301 is an equidigital number, since it uses as much as digits as its factorization.
20322020211301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 20322020211301 its reverse (10311202022302), we get a palindrome (30633222233603).
The spelling of 20322020211301 in words is "twenty trillion, three hundred twenty-two billion, twenty million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •