Base | Representation |
---|---|
bin | 101101101110101100101000… |
… | …010101001101110011101011 |
3 | 222101002222201222022010002120 |
4 | 231232230220111031303223 |
5 | 202330132013204020021 |
6 | 1551425432412202323 |
7 | 60235343413046142 |
oct | 5556545025156353 |
9 | 871088658263076 |
10 | 201121110220011 |
11 | 590a0a90559063 |
12 | 1a682750a693a3 |
13 | 882b8407604a7 |
14 | 3794456a12759 |
15 | 183b94ceb02c6 |
hex | b6eb2854dceb |
201121110220011 has 4 divisors (see below), whose sum is σ = 268161480293352. Its totient is φ = 134080740146672.
The previous prime is 201121110219949. The next prime is 201121110220021. The reversal of 201121110220011 is 110022011121102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201121110220011 - 221 = 201121108122859 is a prime.
It is a super-2 number, since 2×2011211102200112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201121110220021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33520185036666 + ... + 33520185036671.
It is an arithmetic number, because the mean of its divisors is an integer number (67040370073338).
Almost surely, 2201121110220011 is an apocalyptic number.
201121110220011 is a deficient number, since it is larger than the sum of its proper divisors (67040370073341).
201121110220011 is an equidigital number, since it uses as much as digits as its factorization.
201121110220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67040370073340.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201121110220011 its reverse (110022011121102), we get a palindrome (311143121341113).
The spelling of 201121110220011 in words is "two hundred one trillion, one hundred twenty-one billion, one hundred ten million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •