Base | Representation |
---|---|
bin | 100000001100001100101… |
… | …111110010100111001111 |
3 | 21211110212120211112222000 |
4 | 200030030233302213033 |
5 | 242220411213341421 |
6 | 4412122415523343 |
7 | 315551305600164 |
oct | 40141457624717 |
9 | 7743776745860 |
10 | 2212122012111 |
11 | 78317922a110 |
12 | 2b8883229553 |
13 | 1307aa097a7b |
14 | 790d287006b |
15 | 3c820774226 |
hex | 2030cbf29cf |
2212122012111 has 16 divisors (see below), whose sum is σ = 3575146686720. Its totient is φ = 1340680007160.
The previous prime is 2212122012101. The next prime is 2212122012143. The reversal of 2212122012111 is 1112102212122.
2212122012111 is a `hidden beast` number, since 221 + 212 + 20 + 1 + 211 + 1 = 666.
2212122012111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2212122012111 - 29 = 2212122011599 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2212122012101) 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, 3724110835 + ... + 3724111428.
It is an arithmetic number, because the mean of its divisors is an integer number (223446667920).
Almost surely, 22212122012111 is an apocalyptic number.
2212122012111 is a deficient number, since it is larger than the sum of its proper divisors (1363024674609).
2212122012111 is a wasteful number, since it uses less digits than its factorization.
2212122012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7448222283 (or 7448222277 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 2212122012111 its reverse (1112102212122), we get a palindrome (3324224224233).
The spelling of 2212122012111 in words is "two trillion, two hundred twelve billion, one hundred twenty-two million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •