Base | Representation |
---|---|
bin | 11101010001001100100… |
… | …111100100010001100101 |
3 | 21010021121001111100110221 |
4 | 131101030213210101211 |
5 | 230423201003311031 |
6 | 4135554201044341 |
7 | 265212431031025 |
oct | 35211447442145 |
9 | 7107531440427 |
10 | 2011330135141 |
11 | 706000476038 |
12 | 2859864866b1 |
13 | 11788a9ab152 |
14 | 6d4c5539a85 |
15 | 374bca2ea11 |
hex | 1d44c9e4465 |
2011330135141 has 2 divisors, whose sum is σ = 2011330135142. Its totient is φ = 2011330135140.
The previous prime is 2011330135093. The next prime is 2011330135169. The reversal of 2011330135141 is 1415310331102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1119162989025 + 892167146116 = 1057905^2 + 944546^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011330135141 - 215 = 2011330102373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011330136141) 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, 1005665067570 + 1005665067571.
It is an arithmetic number, because the mean of its divisors is an integer number (1005665067571).
Almost surely, 22011330135141 is an apocalyptic number.
It is an amenable number.
2011330135141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011330135141 is an equidigital number, since it uses as much as digits as its factorization.
2011330135141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 2011330135141 its reverse (1415310331102), we get a palindrome (3426640466243).
The spelling of 2011330135141 in words is "two trillion, eleven billion, three hundred thirty million, one hundred thirty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •