Base | Representation |
---|---|
bin | 110000000000000100011100… |
… | …001010110111011111111101 |
3 | 1000200111000101120120121202210 |
4 | 300000010130022313133331 |
5 | 210132320312012023401 |
6 | 2024555015442411033 |
7 | 62316160246054326 |
oct | 6000043412673775 |
9 | 1020430346517683 |
10 | 211111000111101 |
11 | 612a2743a01672 |
12 | 1b816886960a79 |
13 | 90a48b315873c |
14 | 3a1bb8111944d |
15 | 19617355454d6 |
hex | c0011c2b77fd |
211111000111101 has 12 divisors (see below), whose sum is σ = 283357793495616. Its totient is φ = 139808609299800.
The previous prime is 211111000111007. The next prime is 211111000111157. The reversal of 211111000111101 is 101111000111112.
It is a de Polignac number, because none of the positive numbers 2k-211111000111101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211111000111901) 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 11 ways as a sum of consecutive naturals, for example, 1543072981 + ... + 1543209786.
It is an arithmetic number, because the mean of its divisors is an integer number (23613149457968).
Almost surely, 2211111000111101 is an apocalyptic number.
It is an amenable number.
211111000111101 is a deficient number, since it is larger than the sum of its proper divisors (72246793384515).
211111000111101 is an equidigital number, since it uses as much as digits as its factorization.
211111000111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3086283072 (or 3086282921 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 211111000111101 its reverse (101111000111112), we get a palindrome (312222000222213).
The spelling of 211111000111101 in words is "two hundred eleven trillion, one hundred eleven billion, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •