Base | Representation |
---|---|
bin | 11101010000111110111… |
… | …101100001110000111001 |
3 | 21010021000002100122020200 |
4 | 131100332331201300321 |
5 | 230422213324323001 |
6 | 4135515334112413 |
7 | 265203646353435 |
oct | 35207675416071 |
9 | 7107002318220 |
10 | 2011101011001 |
11 | 7059a3100745 |
12 | 2859217ab709 |
13 | 117852397734 |
14 | 6d4a2d359c5 |
15 | 374a7871086 |
hex | 1d43ef61c39 |
2011101011001 has 24 divisors (see below), whose sum is σ = 2908410535680. Its totient is φ = 1339125518016.
The previous prime is 2011101010999. The next prime is 2011101011021. The reversal of 2011101011001 is 1001101011102.
It is not a de Polignac number, because 2011101011001 - 21 = 2011101010999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (2011101011021) 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 23 ways as a sum of consecutive naturals, for example, 30965280 + ... + 31030158.
It is an arithmetic number, because the mean of its divisors is an integer number (121183772320).
Almost surely, 22011101011001 is an apocalyptic number.
It is an amenable number.
2011101011001 is a deficient number, since it is larger than the sum of its proper divisors (897309524679).
2011101011001 is a wasteful number, since it uses less digits than its factorization.
2011101011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68965 (or 68962 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 2011101011001 its reverse (1001101011102), we get a palindrome (3012202022103).
It can be divided in two parts, 201110101 and 1001, that added together give a palindrome (201111102).
The spelling of 2011101011001 in words is "two trillion, eleven billion, one hundred one million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •