Base | Representation |
---|---|
bin | 1010000000010100000110… |
… | …00110111001000100010101 |
3 | 2212220021111001121000201121 |
4 | 11000022003012321010111 |
5 | 10340431043130041041 |
6 | 114443044030323541 |
7 | 4430343560234251 |
oct | 500120306710425 |
9 | 85807431530647 |
10 | 22001022112021 |
11 | 70126434647a7 |
12 | 2573b419595b1 |
13 | c378c2527b04 |
14 | 560bd8773261 |
15 | 28246c9617d1 |
hex | 1402831b9115 |
22001022112021 has 2 divisors, whose sum is σ = 22001022112022. Its totient is φ = 22001022112020.
The previous prime is 22001022111997. The next prime is 22001022112057. The reversal of 22001022112021 is 12021122010022.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21806751852900 + 194270259121 = 4669770^2 + 440761^2 .
It is a cyclic number.
It is not a de Polignac number, because 22001022112021 - 241 = 19801998856469 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22001022111986 and 22001022112004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22001022112081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11000511056010 + 11000511056011.
It is an arithmetic number, because the mean of its divisors is an integer number (11000511056011).
Almost surely, 222001022112021 is an apocalyptic number.
It is an amenable number.
22001022112021 is a deficient number, since it is larger than the sum of its proper divisors (1).
22001022112021 is an equidigital number, since it uses as much as digits as its factorization.
22001022112021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22001022112021 its reverse (12021122010022), we get a palindrome (34022144122043).
The spelling of 22001022112021 in words is "twenty-two trillion, one billion, twenty-two million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •