Base | Representation |
---|---|
bin | 1010000000100110101101… |
… | …00101001111010100101101 |
3 | 2212221020021022021212202101 |
4 | 11000103112211033110231 |
5 | 10341112023200323041 |
6 | 114451415231255101 |
7 | 4431146260231042 |
oct | 500232645172455 |
9 | 85836238255671 |
10 | 22011012511021 |
11 | 70168aa8113a6 |
12 | 2575a6b67a491 |
13 | c38825233201 |
14 | 5614a55171c9 |
15 | 282854a74b31 |
hex | 1404d694f52d |
22011012511021 has 2 divisors, whose sum is σ = 22011012511022. Its totient is φ = 22011012511020.
The previous prime is 22011012511013. The next prime is 22011012511051. The reversal of 22011012511021 is 12011521011022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21265102188100 + 745910322921 = 4611410^2 + 863661^2 .
It is a cyclic number.
It is not a de Polignac number, because 22011012511021 - 23 = 22011012511013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22011012511021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22011012511051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11005506255510 + 11005506255511.
It is an arithmetic number, because the mean of its divisors is an integer number (11005506255511).
Almost surely, 222011012511021 is an apocalyptic number.
It is an amenable number.
22011012511021 is a deficient number, since it is larger than the sum of its proper divisors (1).
22011012511021 is an equidigital number, since it uses as much as digits as its factorization.
22011012511021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 19.
Adding to 22011012511021 its reverse (12011521011022), we get a palindrome (34022533522043).
The spelling of 22011012511021 in words is "twenty-two trillion, eleven billion, twelve million, five hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •