Base | Representation |
---|---|
bin | 101101101110100010011001… |
… | …010100101101010000100011 |
3 | 222101001221101010011102020012 |
4 | 231232202121110231100203 |
5 | 202324442011434311321 |
6 | 1551420414131235135 |
7 | 60234504164233460 |
oct | 5556423124552043 |
9 | 871057333142205 |
10 | 201110121010211 |
11 | 59097361420096 |
12 | 1a6805a4748aab |
13 | 882a7abb4329a |
14 | 3793ad3350667 |
15 | 183b50835305b |
hex | b6e89952d423 |
201110121010211 has 8 divisors (see below), whose sum is σ = 235185257793024. Its totient is φ = 168371264101320.
The previous prime is 201110121010207. The next prime is 201110121010229. The reversal of 201110121010211 is 112010121011102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201110121010211 - 22 = 201110121010207 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201110121010231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 334069968155 + ... + 334069968756.
It is an arithmetic number, because the mean of its divisors is an integer number (29398157224128).
Almost surely, 2201110121010211 is an apocalyptic number.
201110121010211 is a deficient number, since it is larger than the sum of its proper divisors (34075136782813).
201110121010211 is an equidigital number, since it uses as much as digits as its factorization.
201110121010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668139936961.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 201110121010211 its reverse (112010121011102), we get a palindrome (313120242021313).
The spelling of 201110121010211 in words is "two hundred one trillion, one hundred ten billion, one hundred twenty-one million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •