Base | Representation |
---|---|
bin | 101101101110101100101000… |
… | …011000100111000111011111 |
3 | 222101002222202000222100002020 |
4 | 231232230220120213013133 |
5 | 202330132013421010421 |
6 | 1551425432443231223 |
7 | 60235343423444163 |
oct | 5556545030470737 |
9 | 871088660870066 |
10 | 201121111110111 |
11 | 590a0a91006885 |
12 | 1a682751218513 |
13 | 882b8409b268a |
14 | 3794456ba4ca3 |
15 | 183b94d0d8dc6 |
hex | b6eb286271df |
201121111110111 has 8 divisors (see below), whose sum is σ = 268161642366000. Its totient is φ = 134080660297152.
The previous prime is 201121111110109. The next prime is 201121111110131. The reversal of 201121111110111 is 111011111121102.
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 201121111110111 - 21 = 201121111110109 is a prime.
It is a super-2 number, since 2×2011211111101112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201121111110131) 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, 14012860 + ... + 24466353.
It is an arithmetic number, because the mean of its divisors is an integer number (33520205295750).
Almost surely, 2201121111110111 is an apocalyptic number.
201121111110111 is a deficient number, since it is larger than the sum of its proper divisors (67040531255889).
201121111110111 is a wasteful number, since it uses less digits than its factorization.
201121111110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40221465.
The product of its (nonzero) digits is 4, while the sum is 15.
Adding to 201121111110111 its reverse (111011111121102), we get a palindrome (312132222231213).
The spelling of 201121111110111 in words is "two hundred one trillion, one hundred twenty-one billion, one hundred eleven million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •