Base | Representation |
---|---|
bin | 111011111011101… |
… | …1011111011001001 |
3 | 12012011002110012022 |
4 | 1313313123323021 |
5 | 13104310133001 |
6 | 531315054225 |
7 | 100556252663 |
oct | 16767337311 |
9 | 5164073168 |
10 | 2011021001 |
11 | 942194930 |
12 | 4815a1375 |
13 | 260835872 |
14 | 151127533 |
15 | bb83d11b |
hex | 77ddbec9 |
2011021001 has 8 divisors (see below), whose sum is σ = 2322890784. Its totient is φ = 1720659520.
The previous prime is 2011020989. The next prime is 2011021043. The reversal of 2011021001 is 1001201102.
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 2011021001 - 218 = 2010758857 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2011021001.
It is not an unprimeable number, because it can be changed into a prime (2011021081) 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, 5376875 + ... + 5377248.
It is an arithmetic number, because the mean of its divisors is an integer number (290361348).
Almost surely, 22011021001 is an apocalyptic number.
It is an amenable number.
2011021001 is a deficient number, since it is larger than the sum of its proper divisors (311869783).
2011021001 is a wasteful number, since it uses less digits than its factorization.
2011021001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10754151.
The product of its (nonzero) digits is 4, while the sum is 8.
The square root of 2011021001 is about 44844.4088042200. The cubic root of 2011021001 is about 1262.2310771329.
Adding to 2011021001 its reverse (1001201102), we get a palindrome (3012222103).
It can be divided in two parts, 201102 and 1001, that multiplied together give a palindrome (201303102).
The spelling of 2011021001 in words is "two billion, eleven million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •