Base | Representation |
---|---|
bin | 101101101110100011010011… |
… | …110011010110100001111111 |
3 | 222101002000220111022001201222 |
4 | 231232203103303112201333 |
5 | 202330001014120401421 |
6 | 1551421055340023555 |
7 | 60234540406446146 |
oct | 5556432363264177 |
9 | 871060814261658 |
10 | 201111102122111 |
11 | 59097815212a75 |
12 | 1a680819231bbb |
13 | 882a90719917c |
14 | 3793b8778275d |
15 | 183b564552cab |
hex | b6e8d3cd687f |
201111102122111 has 2 divisors, whose sum is σ = 201111102122112. Its totient is φ = 201111102122110.
The previous prime is 201111102122083. The next prime is 201111102122129. The reversal of 201111102122111 is 111221201111102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201111102122111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201111102122111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201111102122311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100555551061055 + 100555551061056.
It is an arithmetic number, because the mean of its divisors is an integer number (100555551061056).
Almost surely, 2201111102122111 is an apocalyptic number.
201111102122111 is a deficient number, since it is larger than the sum of its proper divisors (1).
201111102122111 is an equidigital number, since it uses as much as digits as its factorization.
201111102122111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 201111102122111 its reverse (111221201111102), we get a palindrome (312332303233213).
The spelling of 201111102122111 in words is "two hundred one trillion, one hundred eleven billion, one hundred two million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •