Base | Representation |
---|---|
bin | 110000000001010111010110… |
… | …001110101001101010011101 |
3 | 1000200210112011121002220012011 |
4 | 300001113112032221222131 |
5 | 210140300120334323401 |
6 | 2025103541125311221 |
7 | 62325461256165043 |
oct | 6001272616515235 |
9 | 1020715147086164 |
10 | 211200021011101 |
11 | 61327475984401 |
12 | 1b82bb8b865511 |
13 | 90b00cc17a7b5 |
14 | 3a221c7d8a393 |
15 | 1963be596d451 |
hex | c015d63a9a9d |
211200021011101 has 32 divisors (see below), whose sum is σ = 221931021312000. Its totient is φ = 200758687825920.
The previous prime is 211200021011093. The next prime is 211200021011173. The reversal of 211200021011101 is 101110120002112.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 211200021011101 - 23 = 211200021011093 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 (211200021011201) 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, 3395085540 + ... + 3395147746.
It is an arithmetic number, because the mean of its divisors is an integer number (6935344416000).
Almost surely, 2211200021011101 is an apocalyptic number.
It is an amenable number.
211200021011101 is a deficient number, since it is larger than the sum of its proper divisors (10731000300899).
211200021011101 is a wasteful number, since it uses less digits than its factorization.
211200021011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67029.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 211200021011101 its reverse (101110120002112), we get a palindrome (312310141013213).
The spelling of 211200021011101 in words is "two hundred eleven trillion, two hundred billion, twenty-one million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •