Base | Representation |
---|---|
bin | 1011101101001100110… |
… | …1110110101100011101 |
3 | 201020002211221020110111 |
4 | 2323103031312230131 |
5 | 11243334200320333 |
6 | 232220054410021 |
7 | 20346513546433 |
oct | 2732315665435 |
9 | 636084836414 |
10 | 201112120093 |
11 | 78322604515 |
12 | 32b88060911 |
13 | 15c708546c1 |
14 | 9a3ba96d53 |
15 | 5370e014cd |
hex | 2ed3376b1d |
201112120093 has 2 divisors, whose sum is σ = 201112120094. Its totient is φ = 201112120092.
The previous prime is 201112120007. The next prime is 201112120117. The reversal of 201112120093 is 390021211102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 149074754404 + 52037365689 = 386102^2 + 228117^2 .
It is a cyclic number.
It is not a de Polignac number, because 201112120093 - 237 = 63673166621 is a prime.
It is a super-3 number, since 3×2011121200933 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201112120003) 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, 100556060046 + 100556060047.
It is an arithmetic number, because the mean of its divisors is an integer number (100556060047).
Almost surely, 2201112120093 is an apocalyptic number.
It is an amenable number.
201112120093 is a deficient number, since it is larger than the sum of its proper divisors (1).
201112120093 is an equidigital number, since it uses as much as digits as its factorization.
201112120093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 201112120093 its reverse (390021211102), we get a palindrome (591133331195).
The spelling of 201112120093 in words is "two hundred one billion, one hundred twelve million, one hundred twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •