Base | Representation |
---|---|
bin | 1010000000110111110111… |
… | …0000010111110010101011 |
3 | 1102222120000120022022021202 |
4 | 2200031331300113302223 |
5 | 2420342201404341021 |
6 | 35225550345354415 |
7 | 2214311546313416 |
oct | 240157560276253 |
9 | 42876016268252 |
10 | 11010111012011 |
11 | 35653a86a6991 |
12 | 12999bba98a0b |
13 | 61b33110c3b7 |
14 | 2a0c6c354b7d |
15 | 1415e9194a0b |
hex | a037dc17cab |
11010111012011 has 2 divisors, whose sum is σ = 11010111012012. Its totient is φ = 11010111012010.
The previous prime is 11010111012007. The next prime is 11010111012013. The reversal of 11010111012011 is 11021011101011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11010111012011 - 22 = 11010111012007 is a prime.
Together with 11010111012013, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 11010111011983 and 11010111012001.
It is not a weakly prime, because it can be changed into another prime (11010111012013) 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 as a sum of consecutive naturals, namely, 5505055506005 + 5505055506006.
It is an arithmetic number, because the mean of its divisors is an integer number (5505055506006).
Almost surely, 211010111012011 is an apocalyptic number.
11010111012011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010111012011 is an equidigital number, since it uses as much as digits as its factorization.
11010111012011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11010111012011 its reverse (11021011101011), we get a palindrome (22031122113022).
The spelling of 11010111012011 in words is "eleven trillion, ten billion, one hundred eleven million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •