Base | Representation |
---|---|
bin | 111101011000001001101 |
3 | 10210011212101 |
4 | 13223001031 |
5 | 1003324323 |
6 | 111035101 |
7 | 23044411 |
oct | 7530115 |
9 | 3704771 |
10 | 2011213 |
11 | 1154066 |
12 | 80ba91 |
13 | 555589 |
14 | 3a4d41 |
15 | 29adad |
hex | 1eb04d |
2011213 has 4 divisors (see below), whose sum is σ = 2031228. Its totient is φ = 1991200.
The previous prime is 2011211. The next prime is 2011241. The reversal of 2011213 is 3121102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 956484 + 1054729 = 978^2 + 1027^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011213 - 21 = 2011211 is a prime.
It is a Duffinian number.
It is a plaindrome in base 13.
It is a self number, because there is not a number n which added to its sum of digits gives 2011213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9856 + ... + 10057.
It is an arithmetic number, because the mean of its divisors is an integer number (507807).
22011213 is an apocalyptic number.
It is an amenable number.
2011213 is a deficient number, since it is larger than the sum of its proper divisors (20015).
2011213 is a wasteful number, since it uses less digits than its factorization.
2011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20014.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 2011213 is about 1418.1724154700. The cubic root of 2011213 is about 126.2271245683.
Adding to 2011213 its reverse (3121102), we get a palindrome (5132315).
The spelling of 2011213 in words is "two million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •