Base | Representation |
---|---|
bin | 10100101100110001… |
… | …10001001101011011 |
3 | 1001200111002101211101 |
4 | 22112120301031123 |
5 | 140224412310021 |
6 | 5034422212231 |
7 | 542251012045 |
oct | 122630611533 |
9 | 31614071741 |
10 | 11113010011 |
11 | 47930059a4 |
12 | 21a1884077 |
13 | 1081474a8c |
14 | 775ccaa95 |
15 | 450963a91 |
hex | 29663135b |
11113010011 has 2 divisors, whose sum is σ = 11113010012. Its totient is φ = 11113010010.
The previous prime is 11113009979. The next prime is 11113010017. The reversal of 11113010011 is 11001031111.
11113010011 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 11113010011 - 25 = 11113009979 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11113010011.
It is not a weakly prime, because it can be changed into another prime (11113010017) 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, 5556505005 + 5556505006.
It is an arithmetic number, because the mean of its divisors is an integer number (5556505006).
Almost surely, 211113010011 is an apocalyptic number.
11113010011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11113010011 is an equidigital number, since it uses as much as digits as its factorization.
11113010011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 11113010011 its reverse (11001031111), we get a palindrome (22114041122).
The spelling of 11113010011 in words is "eleven billion, one hundred thirteen million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •