Base | Representation |
---|---|
bin | 1011101101001010001… |
… | …1110110101111001101 |
3 | 201020002002012212202110 |
4 | 2323102203312233031 |
5 | 11243323341011341 |
6 | 232215022414233 |
7 | 20346321142614 |
oct | 2732243665715 |
9 | 636062185673 |
10 | 201101110221 |
11 | 78317374650 |
12 | 32b84431379 |
13 | 15c6b49b29b |
14 | 9a3a42c87b |
15 | 536ee79216 |
hex | 2ed28f6bcd |
201101110221 has 32 divisors (see below), whose sum is σ = 307942732800. Its totient is φ = 115450980480.
The previous prime is 201101110181. The next prime is 201101110237. The reversal of 201101110221 is 122011101102.
It is not a de Polignac number, because 201101110221 - 213 = 201101102029 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201101110197 and 201101110206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201101110271) 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, 7767520 + ... + 7793366.
It is an arithmetic number, because the mean of its divisors is an integer number (9623210400).
Almost surely, 2201101110221 is an apocalyptic number.
It is an amenable number.
201101110221 is a deficient number, since it is larger than the sum of its proper divisors (106841622579).
201101110221 is a wasteful number, since it uses less digits than its factorization.
201101110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38289.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201101110221 its reverse (122011101102), we get a palindrome (323112211323).
The spelling of 201101110221 in words is "two hundred one billion, one hundred one million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •