Base | Representation |
---|---|
bin | 11101010000111111000… |
… | …001010011111101011001 |
3 | 21010021000011020001001121 |
4 | 131100333001103331121 |
5 | 230422214103044113 |
6 | 4135515411245241 |
7 | 265203660654604 |
oct | 35207701237531 |
9 | 7107004201047 |
10 | 2011102003033 |
11 | 7059a3719002 |
12 | 285921ba9821 |
13 | 117852654136 |
14 | 6d4a311333b |
15 | 374a79b9e8d |
hex | 1d43f053f59 |
2011102003033 has 2 divisors, whose sum is σ = 2011102003034. Its totient is φ = 2011102003032.
The previous prime is 2011102003019. The next prime is 2011102003039. The reversal of 2011102003033 is 3303002011102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1967250292569 + 43851710464 = 1402587^2 + 209408^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011102003033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2011102002998 and 2011102003016.
It is not a weakly prime, because it can be changed into another prime (2011102003039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005551001516 + 1005551001517.
It is an arithmetic number, because the mean of its divisors is an integer number (1005551001517).
Almost surely, 22011102003033 is an apocalyptic number.
It is an amenable number.
2011102003033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011102003033 is an equidigital number, since it uses as much as digits as its factorization.
2011102003033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 2011102003033 its reverse (3303002011102), we get a palindrome (5314104014135).
The spelling of 2011102003033 in words is "two trillion, eleven billion, one hundred two million, three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •