Base | Representation |
---|---|
bin | 1010000011110001111010… |
… | …10111010101100001000101 |
3 | 2220022122212120112112102221 |
4 | 11001320331113111201011 |
5 | 10344403441420231041 |
6 | 115013501100532341 |
7 | 4442060655033652 |
oct | 501707527254105 |
9 | 86278776475387 |
10 | 22120111102021 |
11 | 70590a5057599 |
12 | 25930385510b1 |
13 | c45bc0a622ba |
14 | 566894ad4c29 |
15 | 2855dc9632d1 |
hex | 141e3d5d5845 |
22120111102021 has 2 divisors, whose sum is σ = 22120111102022. Its totient is φ = 22120111102020.
The previous prime is 22120111101917. The next prime is 22120111102027. The reversal of 22120111102021 is 12020111102122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22062325673025 + 57785428996 = 4697055^2 + 240386^2 .
It is a cyclic number.
It is not a de Polignac number, because 22120111102021 - 229 = 22119574231109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22120111101986 and 22120111102004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22120111102027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11060055551010 + 11060055551011.
It is an arithmetic number, because the mean of its divisors is an integer number (11060055551011).
Almost surely, 222120111102021 is an apocalyptic number.
It is an amenable number.
22120111102021 is a deficient number, since it is larger than the sum of its proper divisors (1).
22120111102021 is an equidigital number, since it uses as much as digits as its factorization.
22120111102021 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 16.
Adding to 22120111102021 its reverse (12020111102122), we get a palindrome (34140222204143).
The spelling of 22120111102021 in words is "twenty-two trillion, one hundred twenty billion, one hundred eleven million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •