Base | Representation |
---|---|
bin | 11110101101010010011… |
… | …000001011001000110010 |
3 | 21110201211020022022011220 |
4 | 132231102120023020302 |
5 | 234033203004323442 |
6 | 4253230105245510 |
7 | 305312665433214 |
oct | 36552230131062 |
9 | 7421736268156 |
10 | 2110211011122 |
11 | 743a32114755 |
12 | 2a0b81493896 |
13 | 123cb86a2416 |
14 | 741c5ac05b4 |
15 | 39d588a6eec |
hex | 1eb5260b232 |
2110211011122 has 8 divisors (see below), whose sum is σ = 4220422022256. Its totient is φ = 703403670372.
The previous prime is 2110211011079. The next prime is 2110211011213. The reversal of 2110211011122 is 2211101120112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
2110211011122 is an admirable number.
It is a super-2 number, since 2×21102110111222 (a number of 25 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 175850917588 + ... + 175850917599.
It is an arithmetic number, because the mean of its divisors is an integer number (527552752782).
Almost surely, 22110211011122 is an apocalyptic number.
2110211011122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110211011122 is a wasteful number, since it uses less digits than its factorization.
2110211011122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351701835192.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 2110211011122 its reverse (2211101120112), we get a palindrome (4321312131234).
The spelling of 2110211011122 in words is "two trillion, one hundred ten billion, two hundred eleven million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •