Base | Representation |
---|---|
bin | 11101010001000110001… |
… | …011110111111000001111 |
3 | 21010021022112102021220200 |
4 | 131101012023313320033 |
5 | 230422440341241421 |
6 | 4135535343544543 |
7 | 265206650506440 |
oct | 35210613677017 |
9 | 7107275367820 |
10 | 2011222212111 |
11 | 705a55562952 |
12 | 2859562bb153 |
13 | 117871522278 |
14 | 6d4b50852c7 |
15 | 374b3312726 |
hex | 1d4462f7e0f |
2011222212111 has 96 divisors (see below), whose sum is σ = 3431094750720. Its totient is φ = 1111666332672.
The previous prime is 2011222212107. The next prime is 2011222212113. The reversal of 2011222212111 is 1112122221102.
It is not a de Polignac number, because 2011222212111 - 22 = 2011222212107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011222212113) 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 95 ways as a sum of consecutive naturals, for example, 52276000 + ... + 52314458.
It is an arithmetic number, because the mean of its divisors is an integer number (35740570320).
Almost surely, 22011222212111 is an apocalyptic number.
2011222212111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2011222212111 is a deficient number, since it is larger than the sum of its proper divisors (1419872538609).
2011222212111 is a wasteful number, since it uses less digits than its factorization.
2011222212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38765 (or 38762 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 2011222212111 its reverse (1112122221102), we get a palindrome (3123344433213).
The spelling of 2011222212111 in words is "two trillion, eleven billion, two hundred twenty-two million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •