Base | Representation |
---|---|
bin | 111011111100010… |
… | …1010000011011111 |
3 | 12012011200201011222 |
4 | 1313320222003133 |
5 | 13104400403043 |
6 | 531330003555 |
7 | 100562054666 |
oct | 16770520337 |
9 | 5164621158 |
10 | 2011341023 |
11 | 94239330a |
12 | 4817165bb |
13 | 260918423 |
14 | 1511abddd |
15 | bb8a2d68 |
hex | 77e2a0df |
2011341023 has 8 divisors (see below), whose sum is σ = 2082494880. Its totient is φ = 1940307040.
The previous prime is 2011340963. The next prime is 2011341071. The reversal of 2011341023 is 3201431102.
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 2011341023 - 28 = 2011340767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011340992 and 2011341010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011301023) 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 7 ways as a sum of consecutive naturals, for example, 4886 + ... + 63612.
It is an arithmetic number, because the mean of its divisors is an integer number (260311860).
Almost surely, 22011341023 is an apocalyptic number.
2011341023 is a deficient number, since it is larger than the sum of its proper divisors (71153857).
2011341023 is a wasteful number, since it uses less digits than its factorization.
2011341023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59937.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2011341023 is about 44847.9767994053. The cubic root of 2011341023 is about 1262.2980282469.
Adding to 2011341023 its reverse (3201431102), we get a palindrome (5212772125).
The spelling of 2011341023 in words is "two billion, eleven million, three hundred forty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •