Base | Representation |
---|---|
bin | 1100010010011111011… |
… | …0111100001000100011 |
3 | 202011221110111110112212 |
4 | 3010213312330020203 |
5 | 11424334230023021 |
6 | 240553235312335 |
7 | 21152542222430 |
oct | 3044766741043 |
9 | 664843443485 |
10 | 211122111011 |
11 | 81599a22889 |
12 | 34b0044b6ab |
13 | 16ba762c556 |
14 | a30b29ab87 |
15 | 5759ad485b |
hex | 3127dbc223 |
211122111011 has 4 divisors (see below), whose sum is σ = 241282412592. Its totient is φ = 180961809432.
The previous prime is 211122110977. The next prime is 211122111041. The reversal of 211122111011 is 110111221112.
211122111011 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 211122111011 - 210 = 211122109987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211122111041) 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, 15080150780 + ... + 15080150793.
It is an arithmetic number, because the mean of its divisors is an integer number (60320603148).
Almost surely, 2211122111011 is an apocalyptic number.
211122111011 is a deficient number, since it is larger than the sum of its proper divisors (30160301581).
211122111011 is an equidigital number, since it uses as much as digits as its factorization.
211122111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30160301580.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 211122111011 its reverse (110111221112), we get a palindrome (321233332123).
The spelling of 211122111011 in words is "two hundred eleven billion, one hundred twenty-two million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •