Base | Representation |
---|---|
bin | 1001100011110100110000… |
… | …00000011100011110111001 |
3 | 2202102200202200221112011221 |
4 | 10301322120000130132321 |
5 | 10223411300232400441 |
6 | 112413232333152041 |
7 | 4266540510253165 |
oct | 461723000343671 |
9 | 82380680845157 |
10 | 21022120200121 |
11 | 6775481897757 |
12 | 243628962b621 |
13 | b964ba298591 |
14 | 5296943b3ca5 |
15 | 266c785708d1 |
hex | 131e9801c7b9 |
21022120200121 has 2 divisors, whose sum is σ = 21022120200122. Its totient is φ = 21022120200120.
The previous prime is 21022120200073. The next prime is 21022120200157. The reversal of 21022120200121 is 12100202122012.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21005135594496 + 16984605625 = 4583136^2 + 130325^2 .
It is a cyclic number.
It is not a de Polignac number, because 21022120200121 - 213 = 21022120191929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21022120200095 and 21022120200104.
It is not a weakly prime, because it can be changed into another prime (21022120200721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10511060100060 + 10511060100061.
It is an arithmetic number, because the mean of its divisors is an integer number (10511060100061).
Almost surely, 221022120200121 is an apocalyptic number.
It is an amenable number.
21022120200121 is a deficient number, since it is larger than the sum of its proper divisors (1).
21022120200121 is an equidigital number, since it uses as much as digits as its factorization.
21022120200121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21022120200121 its reverse (12100202122012), we get a palindrome (33122322322133).
The spelling of 21022120200121 in words is "twenty-one trillion, twenty-two billion, one hundred twenty million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •