Base | Representation |
---|---|
bin | 101101101110011010000000… |
… | …001111001100111010011011 |
3 | 222101001002010010201221011011 |
4 | 231232122000033030322123 |
5 | 202324320033202431021 |
6 | 1551412324042314351 |
7 | 60234034660515565 |
oct | 5556320017147233 |
9 | 871032103657134 |
10 | 201101110202011 |
11 | 59093558017568 |
12 | 1a67a8aaab89b7 |
13 | 88299a407a606 |
14 | 37934ba724335 |
15 | 183b17c23dde1 |
hex | b6e6803cce9b |
201101110202011 has 2 divisors, whose sum is σ = 201101110202012. Its totient is φ = 201101110202010.
The previous prime is 201101110201973. The next prime is 201101110202023. The reversal of 201101110202011 is 110202011101102.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201101110202011 - 221 = 201101108104859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201101110201982 and 201101110202000.
It is not a weakly prime, because it can be changed into another prime (201101110202071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550555101005 + 100550555101006.
It is an arithmetic number, because the mean of its divisors is an integer number (100550555101006).
Almost surely, 2201101110202011 is an apocalyptic number.
201101110202011 is a deficient number, since it is larger than the sum of its proper divisors (1).
201101110202011 is an equidigital number, since it uses as much as digits as its factorization.
201101110202011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201101110202011 its reverse (110202011101102), we get a palindrome (311303121303113).
The spelling of 201101110202011 in words is "two hundred one trillion, one hundred one billion, one hundred ten million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •