Base | Representation |
---|---|
bin | 101101101110100010011001… |
… | …010100101101011111000100 |
3 | 222101001221101010011110111121 |
4 | 231232202121110231133010 |
5 | 202324442011434324030 |
6 | 1551420414131243324 |
7 | 60234504164236255 |
oct | 5556423124553704 |
9 | 871057333143447 |
10 | 201110121011140 |
11 | 59097361420860 |
12 | 1a6805a4749544 |
13 | 882a7abb43833 |
14 | 3793ad3350b2c |
15 | 183b50835347a |
hex | b6e89952d7c4 |
201110121011140 has 48 divisors (see below), whose sum is σ = 460798972159680. Its totient is φ = 73119212196480.
The previous prime is 201110121011081. The next prime is 201110121011141. The reversal of 201110121011140 is 41110121011102.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (201110121011141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72007122 + ... + 74747881.
It is an arithmetic number, because the mean of its divisors is an integer number (9599978586660).
Almost surely, 2201110121011140 is an apocalyptic number.
201110121011140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201110121011140 is an abundant number, since it is smaller than the sum of its proper divisors (259688851148540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201110121011140 is a wasteful number, since it uses less digits than its factorization.
201110121011140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146761252 (or 146761250 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 201110121011140 its reverse (41110121011102), we get a palindrome (242220242022242).
The spelling of 201110121011140 in words is "two hundred one trillion, one hundred ten billion, one hundred twenty-one million, eleven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •