Base | Representation |
---|---|
bin | 1010000000100110111001… |
… | …00001100110100101110111 |
3 | 2212221020112020220200012022 |
4 | 11000103130201212211313 |
5 | 10341112224212033142 |
6 | 114451433152343355 |
7 | 4431151610604605 |
oct | 500233441464567 |
9 | 85836466820168 |
10 | 22011112221047 |
11 | 7016951024a84 |
12 | 2575a98b44b5b |
13 | c3883caa4a21 |
14 | 5614b4870875 |
15 | 28285d6bd6d2 |
hex | 1404dc866977 |
22011112221047 has 2 divisors, whose sum is σ = 22011112221048. Its totient is φ = 22011112221046.
The previous prime is 22011112220983. The next prime is 22011112221073. The reversal of 22011112221047 is 74012221111022.
It is an a-pointer prime, because the next prime (22011112221073) can be obtained adding 22011112221047 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22011112221047 - 26 = 22011112220983 is a prime.
It is a super-2 number, since 2×220111122210472 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22011112221247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11005556110523 + 11005556110524.
It is an arithmetic number, because the mean of its divisors is an integer number (11005556110524).
Almost surely, 222011112221047 is an apocalyptic number.
22011112221047 is a deficient number, since it is larger than the sum of its proper divisors (1).
22011112221047 is an equidigital number, since it uses as much as digits as its factorization.
22011112221047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 896, while the sum is 26.
Adding to 22011112221047 its reverse (74012221111022), we get a palindrome (96023333332069).
The spelling of 22011112221047 in words is "twenty-two trillion, eleven billion, one hundred twelve million, two hundred twenty-one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •