Base | Representation |
---|---|
bin | 1010000000100110111000… |
… | …11100111111001010111101 |
3 | 2212221020112011122012022221 |
4 | 11000103130130333022331 |
5 | 10341112223404323010 |
6 | 114451433110405341 |
7 | 4431151564405024 |
oct | 500233434771275 |
9 | 85836464565287 |
10 | 22011111011005 |
11 | 7016950378946 |
12 | 2575a98660851 |
13 | c3883c77001c |
14 | 5614b46378bb |
15 | 28285d52edda |
hex | 1404dc73f2bd |
22011111011005 has 16 divisors (see below), whose sum is σ = 27803678256000. Its totient is φ = 16682003421120.
The previous prime is 22011111011003. The next prime is 22011111011011. The reversal of 22011111011005 is 50011011111022.
It is not a de Polignac number, because 22011111011005 - 21 = 22011111011003 is a prime.
It is a super-2 number, since 2×220111110110052 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22011111011005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011111011003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17368671 + ... + 18592819.
It is an arithmetic number, because the mean of its divisors is an integer number (1737729891000).
Almost surely, 222011111011005 is an apocalyptic number.
It is an amenable number.
22011111011005 is a deficient number, since it is larger than the sum of its proper divisors (5792567244995).
22011111011005 is a wasteful number, since it uses less digits than its factorization.
22011111011005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1413444.
The product of its (nonzero) digits is 20, while the sum is 16.
Adding to 22011111011005 its reverse (50011011111022), we get a palindrome (72022122122027).
The spelling of 22011111011005 in words is "twenty-two trillion, eleven billion, one hundred eleven million, eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •