Base | Representation |
---|---|
bin | 101101101110011001111010… |
… | …111111100010100000111110 |
3 | 222101001001220000011110221212 |
4 | 231232121322333202200332 |
5 | 202324314343141210420 |
6 | 1551412311220324422 |
7 | 60234032541555461 |
oct | 5556317277424076 |
9 | 871031800143855 |
10 | 201101022210110 |
11 | 59093512387990 |
12 | 1a67a885543712 |
13 | 882998ba7c6b9 |
14 | 37934acb7b2d8 |
15 | 183b17465c3c5 |
hex | b6e67afe283e |
201101022210110 has 32 divisors (see below), whose sum is σ = 394899977106432. Its totient is φ = 73125663490080.
The previous prime is 201101022210083. The next prime is 201101022210113. The reversal of 201101022210110 is 11012220101102.
It is a super-2 number, since 2×2011010222101102 (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 (201101022210113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20679674 + ... + 28807133.
It is an arithmetic number, because the mean of its divisors is an integer number (12340624284576).
Almost surely, 2201101022210110 is an apocalyptic number.
201101022210110 is a deficient number, since it is larger than the sum of its proper divisors (193798954896322).
201101022210110 is a wasteful number, since it uses less digits than its factorization.
201101022210110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49523768.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201101022210110 its reverse (11012220101102), we get a palindrome (212113242311212).
The spelling of 201101022210110 in words is "two hundred one trillion, one hundred one billion, twenty-two million, two hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •