Base | Representation |
---|---|
bin | 1010000000101000111010… |
… | …10111100010000010101011 |
3 | 2212221100100001221122120210 |
4 | 11000110131113202002223 |
5 | 10341121441211200021 |
6 | 114452133133352203 |
7 | 4431220560455442 |
oct | 500243527420253 |
9 | 85840301848523 |
10 | 22012200100011 |
11 | 701735a110600 |
12 | 2576141338663 |
13 | c389842a05a4 |
14 | 561579135d59 |
15 | 2828c3e5ce76 |
hex | 14051d5e20ab |
22012200100011 has 96 divisors (see below), whose sum is σ = 35159310547200. Its totient is φ = 12192307142400.
The previous prime is 22012200099971. The next prime is 22012200100097. The reversal of 22012200100011 is 11000100221022.
It is not a de Polignac number, because 22012200100011 - 221 = 22012198002859 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22012200100011.
It is not an unprimeable number, because it can be changed into a prime (22012200100211) 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 in 95 ways as a sum of consecutive naturals, for example, 236168760 + ... + 236261946.
It is an arithmetic number, because the mean of its divisors is an integer number (366242818200).
Almost surely, 222012200100011 is an apocalyptic number.
22012200100011 is a deficient number, since it is larger than the sum of its proper divisors (13147110447189).
22012200100011 is a wasteful number, since it uses less digits than its factorization.
22012200100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94441 (or 94430 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 22012200100011 its reverse (11000100221022), we get a palindrome (33012300321033).
The spelling of 22012200100011 in words is "twenty-two trillion, twelve billion, two hundred million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •