Base | Representation |
---|---|
bin | 111011111011101… |
… | …1100001010110001 |
3 | 12012011002111120100 |
4 | 1313313130022301 |
5 | 13104310201001 |
6 | 531315103013 |
7 | 100556255622 |
oct | 16767341261 |
9 | 5164074510 |
10 | 2011022001 |
11 | 94219565a |
12 | 4815a1a69 |
13 | 260836161 |
14 | 151127a49 |
15 | bb83d586 |
hex | 77ddc2b1 |
2011022001 has 12 divisors (see below), whose sum is σ = 2920020480. Its totient is φ = 1333660920.
The previous prime is 2011021993. The next prime is 2011022011. The reversal of 2011022001 is 1002201102.
It is not a de Polignac number, because 2011022001 - 23 = 2011021993 is a prime.
It is a super-3 number, since 3×20110220013 (a number of 29 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (2011022011) 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 11 ways as a sum of consecutive naturals, for example, 583221 + ... + 586658.
It is an arithmetic number, because the mean of its divisors is an integer number (243335040).
Almost surely, 22011022001 is an apocalyptic number.
It is an amenable number.
2011022001 is a deficient number, since it is larger than the sum of its proper divisors (908998479).
2011022001 is a wasteful number, since it uses less digits than its factorization.
2011022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1170076 (or 1170073 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 2011022001 is about 44844.4199538805. The cubic root of 2011022001 is about 1262.2312863519.
Adding to 2011022001 its reverse (1002201102), we get a palindrome (3013223103).
The spelling of 2011022001 in words is "two billion, eleven million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •