Base | Representation |
---|---|
bin | 111011111011101… |
… | …1001100000110001 |
3 | 12012011001221122101 |
4 | 1313313121200301 |
5 | 13104304323441 |
6 | 531314540401 |
7 | 100556212120 |
oct | 16767314061 |
9 | 5164057571 |
10 | 2011011121 |
11 | 942188469 |
12 | 481597701 |
13 | 260831212 |
14 | 151123ab7 |
15 | bb83a231 |
hex | 77dd9831 |
2011011121 has 8 divisors (see below), whose sum is σ = 2311139520. Its totient is φ = 1714093008.
The previous prime is 2011011109. The next prime is 2011011133. The reversal of 2011011121 is 1211101102.
It is an interprime number because it is at equal distance from previous prime (2011011109) and next prime (2011011133).
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 2011011121 - 211 = 2011009073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011011098 and 2011011107.
It is not an unprimeable number, because it can be changed into a prime (2011011221) 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, 801226 + ... + 803731.
It is an arithmetic number, because the mean of its divisors is an integer number (288892440).
Almost surely, 22011011121 is an apocalyptic number.
It is an amenable number.
2011011121 is a deficient number, since it is larger than the sum of its proper divisors (300128399).
2011011121 is a wasteful number, since it uses less digits than its factorization.
2011011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1605143.
The product of its (nonzero) digits is 4, while the sum is 10.
The square root of 2011011121 is about 44844.2986454243. The cubic root of 2011011121 is about 1262.2290100464.
Adding to 2011011121 its reverse (1211101102), we get a palindrome (3222112223).
The spelling of 2011011121 in words is "two billion, eleven million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •