Base | Representation |
---|---|
bin | 1011101101001100110… |
… | …1110110111010110011 |
3 | 201020002211221021201111 |
4 | 2323103031312322303 |
5 | 11243334200333021 |
6 | 232220054414151 |
7 | 20346513552214 |
oct | 2732315667263 |
9 | 636084837644 |
10 | 201112121011 |
11 | 7832260517a |
12 | 32b88061357 |
13 | 15c70854c49 |
14 | 9a3ba9740b |
15 | 5370e018e1 |
hex | 2ed3376eb3 |
201112121011 has 8 divisors (see below), whose sum is σ = 201247081200. Its totient is φ = 200977209888.
The previous prime is 201112121009. The next prime is 201112121051. The reversal of 201112121011 is 110121211102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201112121011 - 21 = 201112121009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201112120982 and 201112121000.
It is not an unprimeable number, because it can be changed into a prime (201112121051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11505100 + ... + 11522566.
It is an arithmetic number, because the mean of its divisors is an integer number (25155885150).
Almost surely, 2201112121011 is an apocalyptic number.
201112121011 is a deficient number, since it is larger than the sum of its proper divisors (134960189).
201112121011 is a wasteful number, since it uses less digits than its factorization.
201112121011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24533.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201112121011 its reverse (110121211102), we get a palindrome (311233332113).
Subtracting from 201112121011 its reverse (110121211102), we obtain a palindrome (90990909909).
The spelling of 201112121011 in words is "two hundred one billion, one hundred twelve million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •