Base | Representation |
---|---|
bin | 1011101101001010001… |
… | …1011011111000010011 |
3 | 201020002002000021212000 |
4 | 2323102203123320103 |
5 | 11243323324001321 |
6 | 232215020205043 |
7 | 20346320204106 |
oct | 2732243337023 |
9 | 636062007760 |
10 | 201101000211 |
11 | 783172a9a31 |
12 | 32b84399783 |
13 | 15c6b4601a7 |
14 | 9a3a40073d |
15 | 536ee56826 |
hex | 2ed28dbe13 |
201101000211 has 64 divisors (see below), whose sum is σ = 322769664000. Its totient is φ = 123352567200.
The previous prime is 201101000167. The next prime is 201101000213. The reversal of 201101000211 is 112000101102.
It is a happy number.
It is not a de Polignac number, because 201101000211 - 27 = 201101000083 is a prime.
It is a super-2 number, since 2×2011010002112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 201101000193 and 201101000202.
It is not an unprimeable number, because it can be changed into a prime (201101000213) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2472136 + ... + 2552186.
It is an arithmetic number, because the mean of its divisors is an integer number (5043276000).
Almost surely, 2201101000211 is an apocalyptic number.
201101000211 is a deficient number, since it is larger than the sum of its proper divisors (121668663789).
201101000211 is a wasteful number, since it uses less digits than its factorization.
201101000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80221 (or 80215 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 201101000211 its reverse (112000101102), we get a palindrome (313101101313).
The spelling of 201101000211 in words is "two hundred one billion, one hundred one million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •