Base | Representation |
---|---|
bin | 110000000000000100100010… |
… | …001000101110001111111110 |
3 | 1000200111000122112221021200201 |
4 | 300000010202020232033332 |
5 | 210132321013123242342 |
6 | 2024555033420114114 |
7 | 62316162602650330 |
oct | 6000044210561776 |
9 | 1020430575837621 |
10 | 211111100212222 |
11 | 612a2795462071 |
12 | 1b8168b439593a |
13 | 90a48cab06282 |
14 | 3a1bb90535450 |
15 | 196173e219db7 |
hex | c0012222e3fe |
211111100212222 has 16 divisors (see below), whose sum is σ = 367306306554240. Its totient is φ = 89125794971928.
The previous prime is 211111100212213. The next prime is 211111100212237. The reversal of 211111100212222 is 222212001111112.
It is a happy number.
It is a super-3 number, since 3×2111111002122223 (a number of 44 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 211111100212222.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 112532568472 + ... + 112532570347.
It is an arithmetic number, because the mean of its divisors is an integer number (22956644159640).
Almost surely, 2211111100212222 is an apocalyptic number.
211111100212222 is a deficient number, since it is larger than the sum of its proper divisors (156195206342018).
211111100212222 is a wasteful number, since it uses less digits than its factorization.
211111100212222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225065138895.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 211111100212222 its reverse (222212001111112), we get a palindrome (433323101323334).
The spelling of 211111100212222 in words is "two hundred eleven trillion, one hundred eleven billion, one hundred million, two hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •