Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0011100110101111001011 |
3 | 1102222122121012021102212011 |
4 | 2200032321103212233023 |
5 | 2420401223141312021 |
6 | 35230233435400351 |
7 | 2214345400413163 |
oct | 240167123465713 |
9 | 42878535242764 |
10 | 11011110104011 |
11 | 356587065a556 |
12 | 129a03a5b30b7 |
13 | 61b4600bc1b4 |
14 | 2a0d24d075a3 |
15 | 141656c46de1 |
hex | a03b94e6bcb |
11011110104011 has 2 divisors, whose sum is σ = 11011110104012. Its totient is φ = 11011110104010.
The previous prime is 11011110103979. The next prime is 11011110104021. The reversal of 11011110104011 is 11040101111011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11011110104011 - 25 = 11011110103979 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11011110103982 and 11011110104000.
It is not a weakly prime, because it can be changed into another prime (11011110104021) 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, 5505555052005 + 5505555052006.
It is an arithmetic number, because the mean of its divisors is an integer number (5505555052006).
Almost surely, 211011110104011 is an apocalyptic number.
11011110104011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011110104011 is an equidigital number, since it uses as much as digits as its factorization.
11011110104011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11011110104011 its reverse (11040101111011), we get a palindrome (22051211215022).
The spelling of 11011110104011 in words is "eleven trillion, eleven billion, one hundred ten million, one hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •