Base | Representation |
---|---|
bin | 101101101110011010000000… |
… | …001110110100010001101101 |
3 | 222101001002010010112210201202 |
4 | 231232122000032310101231 |
5 | 202324320033141213401 |
6 | 1551412324040215245 |
7 | 60234034656615440 |
oct | 5556320016642155 |
9 | 871032103483652 |
10 | 201101110101101 |
11 | 59093557a58771 |
12 | 1a67a8aaa6a525 |
13 | 88299a40436c2 |
14 | 37934ba6d9657 |
15 | 183b17c21e06b |
hex | b6e6803b446d |
201101110101101 has 32 divisors (see below), whose sum is σ = 239596237267200. Its totient is φ = 165139922787840.
The previous prime is 201101110101049. The next prime is 201101110101119. The reversal of 201101110101101 is 101101011101102.
It is a happy number.
It is not a de Polignac number, because 201101110101101 - 238 = 200826232194157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201101110101161) 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 31 ways as a sum of consecutive naturals, for example, 244484351 + ... + 245305523.
It is an arithmetic number, because the mean of its divisors is an integer number (7487382414600).
Almost surely, 2201101110101101 is an apocalyptic number.
It is an amenable number.
201101110101101 is a deficient number, since it is larger than the sum of its proper divisors (38495127166099).
201101110101101 is a wasteful number, since it uses less digits than its factorization.
201101110101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 830549.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 201101110101101 its reverse (101101011101102), we get a palindrome (302202121202203).
The spelling of 201101110101101 in words is "two hundred one trillion, one hundred one billion, one hundred ten million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •