Base | Representation |
---|---|
bin | 11101010001000110000… |
… | …011110100101101111010 |
3 | 21010021022101110002101210 |
4 | 131101012003310231322 |
5 | 230422434321231020 |
6 | 4135535230423550 |
7 | 265206623540520 |
oct | 35210603645572 |
9 | 7107271402353 |
10 | 2011220102010 |
11 | 705a54351569 |
12 | 285955661bb6 |
13 | 117870c639a2 |
14 | 6d4b4a96310 |
15 | 374b30473e0 |
hex | 1d4460f4b7a |
2011220102010 has 128 divisors (see below), whose sum is σ = 5565599424000. Its totient is φ = 455628395520.
The previous prime is 2011220101999. The next prime is 2011220102027. The reversal of 2011220102010 is 102010221102.
It is a super-2 number, since 2×20112201020102 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14354976 + ... + 14494404.
It is an arithmetic number, because the mean of its divisors is an integer number (43481245500).
Almost surely, 22011220102010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2011220102010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2782799712000).
2011220102010 is an abundant number, since it is smaller than the sum of its proper divisors (3554379321990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011220102010 is a wasteful number, since it uses less digits than its factorization.
2011220102010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140056.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2011220102010 its reverse (102010221102), we get a palindrome (2113230323112).
The spelling of 2011220102010 in words is "two trillion, eleven billion, two hundred twenty million, one hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •