Base | Representation |
---|---|
bin | 1010000110000111000111… |
… | …01100111101100011010011 |
3 | 2220121022121220000010100021 |
4 | 11003003203230331203103 |
5 | 10402212013031401321 |
6 | 115114345232004311 |
7 | 4450624633450012 |
oct | 503034354754323 |
9 | 86538556003307 |
10 | 22200211200211 |
11 | 708a069511950 |
12 | 25a6671990697 |
13 | c506178434c5 |
14 | 56a6d2c88a79 |
15 | 287729b05941 |
hex | 1430e3b3d8d3 |
22200211200211 has 16 divisors (see below), whose sum is σ = 25645939590528. Its totient is φ = 18992673936000.
The previous prime is 22200211200203. The next prime is 22200211200241. The reversal of 22200211200211 is 11200211200222.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 22200211200211 - 23 = 22200211200203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22200211200241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5096865 + ... + 8389186.
It is an arithmetic number, because the mean of its divisors is an integer number (1602871224408).
Almost surely, 222200211200211 is an apocalyptic number.
22200211200211 is a deficient number, since it is larger than the sum of its proper divisors (3445728390317).
22200211200211 is a wasteful number, since it uses less digits than its factorization.
22200211200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13494882.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22200211200211 its reverse (11200211200222), we get a palindrome (33400422400433).
It can be divided in two parts, 22200211 and 200211, that added together give a palindrome (22400422).
The spelling of 22200211200211 in words is "twenty-two trillion, two hundred billion, two hundred eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •