Base | Representation |
---|---|
bin | 11101010000111001000… |
… | …000110100100011101000 |
3 | 21010020202010120021112111 |
4 | 131100321000310203220 |
5 | 230422012302223422 |
6 | 4135501411052104 |
7 | 265201325153605 |
oct | 35207100644350 |
9 | 7106663507474 |
10 | 2011001211112 |
11 | 7059518365a3 |
12 | 2858b42a1034 |
13 | 1178377c404a |
14 | 6d4939976ac |
15 | 3749dc0aa77 |
hex | 1d4390348e8 |
2011001211112 has 8 divisors (see below), whose sum is σ = 3770627270850. Its totient is φ = 1005500605552.
The previous prime is 2011001211091. The next prime is 2011001211119. The reversal of 2011001211112 is 2111121001102.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1870641585796 + 140359625316 = 1367714^2 + 374646^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 2011001211092 and 2011001211101.
It is not an unprimeable number, because it can be changed into a prime (2011001211119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 125687575687 + ... + 125687575702.
Almost surely, 22011001211112 is an apocalyptic number.
It is an amenable number.
2011001211112 is a deficient number, since it is larger than the sum of its proper divisors (1759626059738).
2011001211112 is a wasteful number, since it uses less digits than its factorization.
2011001211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251375151395 (or 251375151391 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2011001211112 its reverse (2111121001102), we get a palindrome (4122122212214).
The spelling of 2011001211112 in words is "two trillion, eleven billion, one million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •