Base | Representation |
---|---|
bin | 11101010000111001000… |
… | …000000110011010100000 |
3 | 21010020202010012200021111 |
4 | 131100321000012122200 |
5 | 230422012230201422 |
6 | 4135501403033104 |
7 | 265201323435565 |
oct | 35207100063240 |
9 | 7106663180244 |
10 | 2011001022112 |
11 | 7059517175a5 |
12 | 2858b420b794 |
13 | 117837759004 |
14 | 6d49394886c |
15 | 3749dbbea77 |
hex | 1d4390066a0 |
2011001022112 has 48 divisors (see below), whose sum is σ = 4066365634632. Its totient is φ = 978275957760.
The previous prime is 2011001022101. The next prime is 2011001022169. The reversal of 2011001022112 is 2112201001102.
It can be written as a sum of positive squares in 4 ways, for example, as 1962475981456 + 48525040656 = 1400884^2 + 220284^2 .
It is a super-2 number, since 2×20110010221122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2011001022092 and 2011001022101.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38312878 + ... + 38365330.
Almost surely, 22011001022112 is an apocalyptic number.
It is an amenable number.
2011001022112 is an abundant number, since it is smaller than the sum of its proper divisors (2055364612520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011001022112 is a wasteful number, since it uses less digits than its factorization.
2011001022112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84881 (or 84873 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2011001022112 its reverse (2112201001102), we get a palindrome (4123202023214).
The spelling of 2011001022112 in words is "two trillion, eleven billion, one million, twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •