Base | Representation |
---|---|
bin | 11101010000111010010… |
… | …000100101010001001101 |
3 | 21010020210120220120011020 |
4 | 131100322100211101031 |
5 | 230422033130320023 |
6 | 4135503435144353 |
7 | 265202000656524 |
oct | 35207220452115 |
9 | 7106716816136 |
10 | 2011022120013 |
11 | 705962617785 |
12 | 2858bb2a50b9 |
13 | 11783bc3508a |
14 | 6d49667b4bb |
15 | 374a098ade3 |
hex | 1d43a42544d |
2011022120013 has 8 divisors (see below), whose sum is σ = 2696342508000. Its totient is φ = 1333191572688.
The previous prime is 2011022120011. The next prime is 2011022120017. The reversal of 2011022120013 is 3100212201102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2011022120013 - 21 = 2011022120011 is a prime.
It is a super-3 number, since 3×20110221200133 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2011022119974 and 2011022120001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011022120011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1872459538 + ... + 1872460611.
It is an arithmetic number, because the mean of its divisors is an integer number (337042813500).
Almost surely, 22011022120013 is an apocalyptic number.
It is an amenable number.
2011022120013 is a deficient number, since it is larger than the sum of its proper divisors (685320387987).
2011022120013 is a wasteful number, since it uses less digits than its factorization.
2011022120013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3744920331.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2011022120013 its reverse (3100212201102), we get a palindrome (5111234321115).
The spelling of 2011022120013 in words is "two trillion, eleven billion, twenty-two million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •