Base | Representation |
---|---|
bin | 111011111100010… |
… | …1010000100111001 |
3 | 12012011200201022022 |
4 | 1313320222010321 |
5 | 13104400403423 |
6 | 531330004225 |
7 | 100562055155 |
oct | 16770520471 |
9 | 5164621268 |
10 | 2011341113 |
11 | 942393391 |
12 | 481716675 |
13 | 260918492 |
14 | 1511ac065 |
15 | bb8a2dc8 |
hex | 77e2a139 |
2011341113 has 2 divisors, whose sum is σ = 2011341114. Its totient is φ = 2011341112.
The previous prime is 2011341109. The next prime is 2011341151. The reversal of 2011341113 is 3111431102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1102439209 + 908901904 = 33203^2 + 30148^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011341113 - 22 = 2011341109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2011341091 and 2011341100.
It is not a weakly prime, because it can be changed into another prime (2011341173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005670556 + 1005670557.
It is an arithmetic number, because the mean of its divisors is an integer number (1005670557).
Almost surely, 22011341113 is an apocalyptic number.
It is an amenable number.
2011341113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011341113 is an equidigital number, since it uses as much as digits as its factorization.
2011341113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 2011341113 is about 44847.9778027951. The cubic root of 2011341113 is about 1262.2980470746.
Adding to 2011341113 its reverse (3111431102), we get a palindrome (5122772215).
The spelling of 2011341113 in words is "two billion, eleven million, three hundred forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •