Base | Representation |
---|---|
bin | 111011111011101… |
… | …1001010010100101 |
3 | 12012011001220101202 |
4 | 1313313121102211 |
5 | 13104304311323 |
6 | 531314532245 |
7 | 100556206352 |
oct | 16767312245 |
9 | 5164056352 |
10 | 2011010213 |
11 | 942187813 |
12 | 481597085 |
13 | 260830994 |
14 | 151123629 |
15 | bb839d28 |
hex | 77dd94a5 |
2011010213 has 12 divisors (see below), whose sum is σ = 2047639968. Its totient is φ = 1974917880.
The previous prime is 2011010203. The next prime is 2011010231. The reversal of 2011010213 is 3120101102.
It is a de Polignac number, because none of the positive numbers 2k-2011010213 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2011010194 and 2011010203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011010203) 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, 1389056 + ... + 1390502.
It is an arithmetic number, because the mean of its divisors is an integer number (170636664).
Almost surely, 22011010213 is an apocalyptic number.
It is an amenable number.
2011010213 is a deficient number, since it is larger than the sum of its proper divisors (36629755).
2011010213 is a wasteful number, since it uses less digits than its factorization.
2011010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1784 (or 1681 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 2011010213 is about 44844.2885215052. The cubic root of 2011010213 is about 1262.2288200749.
Adding to 2011010213 its reverse (3120101102), we get a palindrome (5131111315).
The spelling of 2011010213 in words is "two billion, eleven million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •