Base | Representation |
---|---|
bin | 10100101100011110… |
… | …10001010011001011 |
3 | 1001200022101220012011 |
4 | 22112033101103023 |
5 | 140223243120021 |
6 | 5034253000351 |
7 | 542220601423 |
oct | 122617212313 |
9 | 31608356164 |
10 | 11110520011 |
11 | 4791665148 |
12 | 21a0a830b7 |
13 | 1080ab25c6 |
14 | 77583d483 |
15 | 450620de1 |
hex | 2963d14cb |
11110520011 has 2 divisors, whose sum is σ = 11110520012. Its totient is φ = 11110520010.
The previous prime is 11110519969. The next prime is 11110520039. The reversal of 11110520011 is 11002501111.
11110520011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11110520011 - 27 = 11110519883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11110519973 and 11110520000.
It is not a weakly prime, because it can be changed into another prime (11110520711) 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 as a sum of consecutive naturals, namely, 5555260005 + 5555260006.
It is an arithmetic number, because the mean of its divisors is an integer number (5555260006).
Almost surely, 211110520011 is an apocalyptic number.
11110520011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110520011 is an equidigital number, since it uses as much as digits as its factorization.
11110520011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 13.
The spelling of 11110520011 in words is "eleven billion, one hundred ten million, five hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •