Base | Representation |
---|---|
bin | 111011111011111… |
… | …1001101111010001 |
3 | 12012011022122201021 |
4 | 1313313321233101 |
5 | 13104323034441 |
6 | 531321435441 |
7 | 100560302011 |
oct | 16767715721 |
9 | 5164278637 |
10 | 2011143121 |
11 | 942268659 |
12 | 48163bb81 |
13 | 260879320 |
14 | 151159c41 |
15 | bb8643d1 |
hex | 77df9bd1 |
2011143121 has 8 divisors (see below), whose sum is σ = 2166358824. Its totient is φ = 1856000640.
The previous prime is 2011143109. The next prime is 2011143131. The reversal of 2011143121 is 1213411102.
It can be written as a sum of positive squares in 4 ways, for example, as 102414400 + 1908728721 = 10120^2 + 43689^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2011143121 - 211 = 2011141073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011143095 and 2011143104.
It is not an unprimeable number, because it can be changed into a prime (2011143131) 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, 47541 + ... + 79261.
It is an arithmetic number, because the mean of its divisors is an integer number (270794853).
Almost surely, 22011143121 is an apocalyptic number.
It is an amenable number.
2011143121 is a deficient number, since it is larger than the sum of its proper divisors (155215703).
2011143121 is a wasteful number, since it uses less digits than its factorization.
2011143121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36611.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 2011143121 is about 44845.7703802711. The cubic root of 2011143121 is about 1262.2566264334.
Adding to 2011143121 its reverse (1213411102), we get a palindrome (3224554223).
The spelling of 2011143121 in words is "two billion, eleven million, one hundred forty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •