Base | Representation |
---|---|
bin | 111011111011110… |
… | …0001110010010101 |
3 | 12012011010200010122 |
4 | 1313313201302111 |
5 | 13104311420023 |
6 | 531315401325 |
7 | 100556412665 |
oct | 16767416225 |
9 | 5164120118 |
10 | 2011045013 |
11 | 94220097a |
12 | 4815b3245 |
13 | 260843783 |
14 | 1511321a5 |
15 | bb8452c8 |
hex | 77de1c95 |
2011045013 has 2 divisors, whose sum is σ = 2011045014. Its totient is φ = 2011045012.
The previous prime is 2011044961. The next prime is 2011045021. The reversal of 2011045013 is 3105401102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1567605649 + 443439364 = 39593^2 + 21058^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011045013 - 210 = 2011043989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2011044982 and 2011045000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011045033) 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 as a sum of consecutive naturals, namely, 1005522506 + 1005522507.
It is an arithmetic number, because the mean of its divisors is an integer number (1005522507).
Almost surely, 22011045013 is an apocalyptic number.
It is an amenable number.
2011045013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011045013 is an equidigital number, since it uses as much as digits as its factorization.
2011045013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 2011045013 is about 44844.6765291043. The cubic root of 2011045013 is about 1262.2361008783.
Adding to 2011045013 its reverse (3105401102), we get a palindrome (5116446115).
The spelling of 2011045013 in words is "two billion, eleven million, forty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •