Base | Representation |
---|---|
bin | 1010000000100110101011… |
… | …11101100010000100000101 |
3 | 2212221020020120201001021212 |
4 | 11000103111331202010011 |
5 | 10341112013014231041 |
6 | 114451414220221205 |
7 | 4431146102606102 |
oct | 500232575420405 |
9 | 85836216631255 |
10 | 22011002102021 |
11 | 70168a4951a19 |
12 | 2575a6809a805 |
13 | c3882302a43a |
14 | 5614a3da7aa9 |
15 | 282853bba8eb |
hex | 1404d5f62105 |
22011002102021 has 2 divisors, whose sum is σ = 22011002102022. Its totient is φ = 22011002102020.
The previous prime is 22011002101969. The next prime is 22011002102041. The reversal of 22011002102021 is 12020120011022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11290681945921 + 10720320156100 = 3360161^2 + 3274190^2 .
It is a cyclic number.
It is not a de Polignac number, because 22011002102021 - 242 = 17612955590917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22011002101987 and 22011002102005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22011002102041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11005501051010 + 11005501051011.
It is an arithmetic number, because the mean of its divisors is an integer number (11005501051011).
Almost surely, 222011002102021 is an apocalyptic number.
It is an amenable number.
22011002102021 is a deficient number, since it is larger than the sum of its proper divisors (1).
22011002102021 is an equidigital number, since it uses as much as digits as its factorization.
22011002102021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 22011002102021 its reverse (12020120011022), we get a palindrome (34031122113043).
The spelling of 22011002102021 in words is "twenty-two trillion, eleven billion, two million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •