Base | Representation |
---|---|
bin | 11101010001000000000… |
… | …110011011100011110110 |
3 | 21010021001102022120202020 |
4 | 131101000012123203312 |
5 | 230422233222401402 |
6 | 4135521255454010 |
7 | 265204300661100 |
oct | 35210006334366 |
9 | 7107042276666 |
10 | 2011120122102 |
11 | 705a02974143 |
12 | 285928087306 |
13 | 117856329390 |
14 | 6d4a56ac570 |
15 | 374a93988bc |
hex | 1d44019b8f6 |
2011120122102 has 96 divisors (see below), whose sum is σ = 5049880732512. Its totient is φ = 529244222976.
The previous prime is 2011120122073. The next prime is 2011120122149. The reversal of 2011120122102 is 2012210211102.
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 47 ways as a sum of consecutive naturals, for example, 1170948 + ... + 2322360.
It is an arithmetic number, because the mean of its divisors is an integer number (52602924297).
Almost surely, 22011120122102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2011120122102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2524940366256).
2011120122102 is an abundant number, since it is smaller than the sum of its proper divisors (3038760610410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011120122102 is a wasteful number, since it uses less digits than its factorization.
2011120122102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1151902 (or 1151895 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2011120122102 its reverse (2012210211102), we get a palindrome (4023330333204).
The spelling of 2011120122102 in words is "two trillion, eleven billion, one hundred twenty million, one hundred twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •