Base | Representation |
---|---|
bin | 10100110001110011… |
… | …00100000000011001 |
3 | 1001210102101220021022 |
4 | 22120321210000121 |
5 | 140321210123423 |
6 | 5042525452225 |
7 | 543302206415 |
oct | 123071440031 |
9 | 31712356238 |
10 | 11155161113 |
11 | 4804885718 |
12 | 21b3a11075 |
13 | 108a112765 |
14 | 77b73dd45 |
15 | 4544dcdc8 |
hex | 298e64019 |
11155161113 has 2 divisors, whose sum is σ = 11155161114. Its totient is φ = 11155161112.
The previous prime is 11155161071. The next prime is 11155161131. The reversal of 11155161113 is 31116155111.
Together with next prime (11155161131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5737759504 + 5417401609 = 75748^2 + 73603^2 .
It is an emirp because it is prime and its reverse (31116155111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11155161113 - 26 = 11155161049 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11155161163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5577580556 + 5577580557.
It is an arithmetic number, because the mean of its divisors is an integer number (5577580557).
Almost surely, 211155161113 is an apocalyptic number.
It is an amenable number.
11155161113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11155161113 is an equidigital number, since it uses as much as digits as its factorization.
11155161113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 450, while the sum is 26.
The spelling of 11155161113 in words is "eleven billion, one hundred fifty-five million, one hundred sixty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •