Base | Representation |
---|---|
bin | 11101010001000101011… |
… | …101101111101110011100 |
3 | 21010021021200122221210010 |
4 | 131101011131233232130 |
5 | 230422424242320332 |
6 | 4135534232443220 |
7 | 265206442644645 |
oct | 35210535575634 |
9 | 7107250587703 |
10 | 2011210120092 |
11 | 705a49753a48 |
12 | 285952249510 |
13 | 11786bb7a424 |
14 | 6d4b36186cc |
15 | 374b22249cc |
hex | 1d44576fb9c |
2011210120092 has 12 divisors (see below), whose sum is σ = 4692823613576. Its totient is φ = 670403373360.
The previous prime is 2011210120091. The next prime is 2011210120093. The reversal of 2011210120092 is 2900210121102.
It is an interprime number because it is at equal distance from previous prime (2011210120091) and next prime (2011210120093).
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×20112101200922 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011210120091) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83800421659 + ... + 83800421682.
Almost surely, 22011210120092 is an apocalyptic number.
It is an amenable number.
2011210120092 is an abundant number, since it is smaller than the sum of its proper divisors (2681613493484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011210120092 is a wasteful number, since it uses less digits than its factorization.
2011210120092 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167600843348 (or 167600843346 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 2011210120092 its reverse (2900210121102), we get a palindrome (4911420241194).
The spelling of 2011210120092 in words is "two trillion, eleven billion, two hundred ten million, one hundred twenty thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •