Base | Representation |
---|---|
bin | 1001001111011101000011… |
… | …00001010001001001001001 |
3 | 2122221210011001211222210101 |
4 | 10213232201201101021021 |
5 | 10130424331213130441 |
6 | 111115520113045401 |
7 | 4165142030651551 |
oct | 447564141211111 |
9 | 78853131758711 |
10 | 20322200130121 |
11 | 65256621a170a |
12 | 23426b3856861 |
13 | b454b5565bc6 |
14 | 503857958161 |
15 | 253961506231 |
hex | 127ba1851249 |
20322200130121 has 2 divisors, whose sum is σ = 20322200130122. Its totient is φ = 20322200130120.
The previous prime is 20322200129897. The next prime is 20322200130131. The reversal of 20322200130121 is 12103100222302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19197200494521 + 1124999635600 = 4381461^2 + 1060660^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20322200130121 is a prime.
It is not a weakly prime, because it can be changed into another prime (20322200130131) 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, 10161100065060 + 10161100065061.
It is an arithmetic number, because the mean of its divisors is an integer number (10161100065061).
Almost surely, 220322200130121 is an apocalyptic number.
It is an amenable number.
20322200130121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20322200130121 is an equidigital number, since it uses as much as digits as its factorization.
20322200130121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 20322200130121 its reverse (12103100222302), we get a palindrome (32425300352423).
The spelling of 20322200130121 in words is "twenty trillion, three hundred twenty-two billion, two hundred million, one hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •