Base | Representation |
---|---|
bin | 1010000000100110111001… |
… | …00001111100100101010001 |
3 | 2212221020112021002020202101 |
4 | 11000103130201330211101 |
5 | 10341112224222423441 |
6 | 114451433154320401 |
7 | 4431151611431323 |
oct | 500233441744521 |
9 | 85836467066671 |
10 | 22011112311121 |
11 | 701695108671a |
12 | 2575a98b89101 |
13 | c3883cb06a1b |
14 | 5614b4895613 |
15 | 28285d6da231 |
hex | 1404dc87c951 |
22011112311121 has 2 divisors, whose sum is σ = 22011112311122. Its totient is φ = 22011112311120.
The previous prime is 22011112311091. The next prime is 22011112311143. The reversal of 22011112311121 is 12111321111022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21571278071121 + 439834240000 = 4644489^2 + 663200^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22011112311121 is a prime.
It is not a weakly prime, because it can be changed into another prime (22011112371121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11005556155560 + 11005556155561.
It is an arithmetic number, because the mean of its divisors is an integer number (11005556155561).
Almost surely, 222011112311121 is an apocalyptic number.
It is an amenable number.
22011112311121 is a deficient number, since it is larger than the sum of its proper divisors (1).
22011112311121 is an equidigital number, since it uses as much as digits as its factorization.
22011112311121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 22011112311121 its reverse (12111321111022), we get a palindrome (34122433422143).
The spelling of 22011112311121 in words is "twenty-two trillion, eleven billion, one hundred twelve million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •