Base | Representation |
---|---|
bin | 101101101110100010011000… |
… | …110011000110110100011011 |
3 | 222101001221100111120220122120 |
4 | 231232202120303012310123 |
5 | 202324442002210431021 |
6 | 1551420413214352323 |
7 | 60234504026326545 |
oct | 5556423063066433 |
9 | 871057314526576 |
10 | 201110112202011 |
11 | 59097357454391 |
12 | 1a6805a17bb6a3 |
13 | 882a7aa07b02c |
14 | 3793ad20da695 |
15 | 183b5076b32c6 |
hex | b6e898cc6d1b |
201110112202011 has 8 divisors (see below), whose sum is σ = 268352924511504. Its totient is φ = 133970354013600.
The previous prime is 201110112202003. The next prime is 201110112202033. The reversal of 201110112202011 is 110202211011102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201110112202011 - 23 = 201110112202003 is a prime.
It is a super-2 number, since 2×2011101122020112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201110112202001) 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, 25763525716 + ... + 25763533521.
It is an arithmetic number, because the mean of its divisors is an integer number (33544115563938).
Almost surely, 2201110112202011 is an apocalyptic number.
201110112202011 is a deficient number, since it is larger than the sum of its proper divisors (67242812309493).
201110112202011 is a wasteful number, since it uses less digits than its factorization.
201110112202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51527060541.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201110112202011 its reverse (110202211011102), we get a palindrome (311312323213113).
The spelling of 201110112202011 in words is "two hundred one trillion, one hundred ten billion, one hundred twelve million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •