Base | Representation |
---|---|
bin | 1100010010000100111… |
… | …1100000010110100111 |
3 | 202011122201122001012211 |
4 | 3010201033200112213 |
5 | 11424122321012221 |
6 | 240534232224251 |
7 | 21150023562301 |
oct | 3044117402647 |
9 | 664581561184 |
10 | 211011110311 |
11 | 815422a8371 |
12 | 34a8b23b087 |
13 | 16b8a636871 |
14 | a2da644971 |
15 | 574eeaa6e1 |
hex | 31213e05a7 |
211011110311 has 4 divisors (see below), whose sum is σ = 211202417952. Its totient is φ = 210819802672.
The previous prime is 211011110291. The next prime is 211011110351. The reversal of 211011110311 is 113011110112.
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 211011110311 - 229 = 210474239399 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211011110291 and 211011110300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211011110351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95652166 + ... + 95654371.
It is an arithmetic number, because the mean of its divisors is an integer number (52800604488).
Almost surely, 2211011110311 is an apocalyptic number.
211011110311 is a deficient number, since it is larger than the sum of its proper divisors (191307641).
211011110311 is a wasteful number, since it uses less digits than its factorization.
211011110311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191307640.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 211011110311 its reverse (113011110112), we get a palindrome (324022220423).
The spelling of 211011110311 in words is "two hundred eleven billion, eleven million, one hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.980 sec. • engine limits •