Base | Representation |
---|---|
bin | 11101010001001100100… |
… | …111011110101001100101 |
3 | 21010021121001110011212121 |
4 | 131101030213132221211 |
5 | 230423201002041401 |
6 | 4135554200345541 |
7 | 265212430603612 |
oct | 35211447365145 |
9 | 7107531404777 |
10 | 2011330112101 |
11 | 70600045a7a2 |
12 | 2859864752b1 |
13 | 11788a9a080b |
14 | 6d4c5531509 |
15 | 374bca27ca1 |
hex | 1d44c9dea65 |
2011330112101 has 2 divisors, whose sum is σ = 2011330112102. Its totient is φ = 2011330112100.
The previous prime is 2011330112059. The next prime is 2011330112117. The reversal of 2011330112101 is 1012110331102.
It is a happy number.
It is an a-pointer prime, because the next prime (2011330112117) can be obtained adding 2011330112101 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1440957759201 + 570372352900 = 1200399^2 + 755230^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011330112101 - 227 = 2011195894373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011330112161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005665056050 + 1005665056051.
It is an arithmetic number, because the mean of its divisors is an integer number (1005665056051).
Almost surely, 22011330112101 is an apocalyptic number.
It is an amenable number.
2011330112101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011330112101 is an equidigital number, since it uses as much as digits as its factorization.
2011330112101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 2011330112101 its reverse (1012110331102), we get a palindrome (3023440443203).
The spelling of 2011330112101 in words is "two trillion, eleven billion, three hundred thirty million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •