Base | Representation |
---|---|
bin | 101111111110100111011010… |
… | …010100001110010111101011 |
3 | 1000200010110120010122000221111 |
4 | 233332213122110032113223 |
5 | 210124201223410120021 |
6 | 2024441055520451151 |
7 | 62306023016564401 |
oct | 5776473224162753 |
9 | 1020113503560844 |
10 | 211011111020011 |
11 | 61264345139025 |
12 | 1b7bb44a179ab7 |
13 | 909835460bc93 |
14 | 3a16dc6ac9471 |
15 | 195dd3ae178e1 |
hex | bfe9da50e5eb |
211011111020011 has 4 divisors (see below), whose sum is σ = 211012166185912. Its totient is φ = 211010055854112.
The previous prime is 211011111019979. The next prime is 211011111020057. The reversal of 211011111020011 is 110020111110112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211011111020011 - 25 = 211011111019979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211011111019973 and 211011111020000.
It is not an unprimeable number, because it can be changed into a prime (211011111020111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 527282925 + ... + 527682958.
It is an arithmetic number, because the mean of its divisors is an integer number (52753041546478).
Almost surely, 2211011111020011 is an apocalyptic number.
211011111020011 is a deficient number, since it is larger than the sum of its proper divisors (1055165901).
211011111020011 is a wasteful number, since it uses less digits than its factorization.
211011111020011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1055165900.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 211011111020011 its reverse (110020111110112), we get a palindrome (321031222130123).
The spelling of 211011111020011 in words is "two hundred eleven trillion, eleven billion, one hundred eleven million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •