Base | Representation |
---|---|
bin | 10100101101000010… |
… | …10010111000110111 |
3 | 1001200122021221210212 |
4 | 22112201102320313 |
5 | 140231000320421 |
6 | 5034542140035 |
7 | 542306011265 |
oct | 122641227067 |
9 | 31618257725 |
10 | 11115245111 |
11 | 47942a2193 |
12 | 21a258161b |
13 | 1081a78219 |
14 | 77630d435 |
15 | 450c55e5b |
hex | 296852e37 |
11115245111 has 2 divisors, whose sum is σ = 11115245112. Its totient is φ = 11115245110.
The previous prime is 11115245101. The next prime is 11115245123. The reversal of 11115245111 is 11154251111.
11115245111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11115245111 - 26 = 11115245047 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11115245101) 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, 5557622555 + 5557622556.
It is an arithmetic number, because the mean of its divisors is an integer number (5557622556).
Almost surely, 211115245111 is an apocalyptic number.
11115245111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11115245111 is an equidigital number, since it uses as much as digits as its factorization.
11115245111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 200, while the sum is 23.
Adding to 11115245111 its reverse (11154251111), we get a palindrome (22269496222).
The spelling of 11115245111 in words is "eleven billion, one hundred fifteen million, two hundred forty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •