Base | Representation |
---|---|
bin | 111101010111101111101 |
3 | 10210011120200 |
4 | 13222331331 |
5 | 1003323010 |
6 | 111034113 |
7 | 23043663 |
oct | 7527575 |
9 | 3704520 |
10 | 2011005 |
11 | 1153997 |
12 | 80b939 |
13 | 555459 |
14 | 3a4c33 |
15 | 29acc0 |
hex | 1eaf7d |
2011005 has 48 divisors (see below), whose sum is σ = 3818880. Its totient is φ = 975744.
The previous prime is 2011003. The next prime is 2011019. The reversal of 2011005 is 5001102.
It is a happy number.
It is not a de Polignac number, because 2011005 - 21 = 2011003 is a prime.
It is a super-2 number, since 2×20110052 = 8088282220050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 29982 + ... + 30048.
It is an arithmetic number, because the mean of its divisors is an integer number (79560).
22011005 is an apocalyptic number.
It is an amenable number.
2011005 is a deficient number, since it is larger than the sum of its proper divisors (1807875).
2011005 is a wasteful number, since it uses less digits than its factorization.
2011005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130 (or 127 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 9.
The square root of 2011005 is about 1418.0990797543. The cubic root of 2011005 is about 126.2227729412. Note that the first 3 decimals are identical.
Adding to 2011005 its product of nonzero digits (10), we get a triangular number (2011015 = T2005).
Adding to 2011005 its reverse (5001102), we get a palindrome (7012107).
It can be divided in two parts, 20 and 11005, that added together give a square (11025 = 1052).
The spelling of 2011005 in words is "two million, eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •