Base | Representation |
---|---|
bin | 111011111100010… |
… | …0010101110101101 |
3 | 12012011122012000210 |
4 | 1313320202232231 |
5 | 13104343423041 |
6 | 531325213033 |
7 | 100561601346 |
oct | 16770425655 |
9 | 5164565023 |
10 | 2011311021 |
11 | 942372815 |
12 | 481701179 |
13 | 260907885 |
14 | 1511a10cd |
15 | bb899016 |
hex | 77e22bad |
2011311021 has 8 divisors (see below), whose sum is σ = 2839497984. Its totient is φ = 1261999040.
The previous prime is 2011311019. The next prime is 2011311119. The reversal of 2011311021 is 1201131102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2011311021 - 21 = 2011311019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2011310988 and 2011311006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011311011) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 19718685 + ... + 19718786.
It is an arithmetic number, because the mean of its divisors is an integer number (354937248).
Almost surely, 22011311021 is an apocalyptic number.
It is an amenable number.
2011311021 is a deficient number, since it is larger than the sum of its proper divisors (828186963).
2011311021 is a wasteful number, since it uses less digits than its factorization.
2011311021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39437491.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 2011311021 is about 44847.6423126122. The cubic root of 2011311021 is about 1262.2917518948.
Adding to 2011311021 its reverse (1201131102), we get a palindrome (3212442123).
The spelling of 2011311021 in words is "two billion, eleven million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •