Base | Representation |
---|---|
bin | 1100011001111001101… |
… | …1001000101010100011 |
3 | 202101002002112021221221 |
4 | 3012132123020222203 |
5 | 11442422443423021 |
6 | 241522454555511 |
7 | 21253045153354 |
oct | 3063633105243 |
9 | 671062467857 |
10 | 213111311011 |
11 | 8241a863225 |
12 | 35376668b97 |
13 | 17133794b81 |
14 | a459543d2b |
15 | 5824562241 |
hex | 319e6c8aa3 |
213111311011 has 4 divisors (see below), whose sum is σ = 217645594272. Its totient is φ = 208577027752.
The previous prime is 213111310931. The next prime is 213111311047. The reversal of 213111311011 is 110113111312.
213111311011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 213111311011 - 213 = 213111302819 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213111317011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2267141560 + ... + 2267141653.
It is an arithmetic number, because the mean of its divisors is an integer number (54411398568).
Almost surely, 2213111311011 is an apocalyptic number.
213111311011 is a deficient number, since it is larger than the sum of its proper divisors (4534283261).
213111311011 is an equidigital number, since it uses as much as digits as its factorization.
213111311011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4534283260.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 213111311011 its reverse (110113111312), we get a palindrome (323224422323).
The spelling of 213111311011 in words is "two hundred thirteen billion, one hundred eleven million, three hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •