Base | Representation |
---|---|
bin | 10000001110100010000… |
… | …110011000100011101111 |
3 | 10221121022100200211021212 |
4 | 100032202012120203233 |
5 | 121232224211041421 |
6 | 2212135520145035 |
7 | 143364421363151 |
oct | 20164206304357 |
9 | 3847270624255 |
10 | 1115116112111 |
11 | 39aa10a79831 |
12 | 16014a16817b |
13 | 812026b9701 |
14 | 3bd86cb4ad1 |
15 | 1e017a9de5b |
hex | 103a21988ef |
1115116112111 has 2 divisors, whose sum is σ = 1115116112112. Its totient is φ = 1115116112110.
The previous prime is 1115116112107. The next prime is 1115116112171. The reversal of 1115116112111 is 1112116115111.
It is a m-pointer prime, because the next prime (1115116112171) can be obtained adding 1115116112111 to its product of digits (60).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1115116112111 - 22 = 1115116112107 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1115116112101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557558056055 + 557558056056.
It is an arithmetic number, because the mean of its divisors is an integer number (557558056056).
Almost surely, 21115116112111 is an apocalyptic number.
1115116112111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1115116112111 is an equidigital number, since it uses as much as digits as its factorization.
1115116112111 is an evil number, because the sum of its binary digits is even.
The product of its digits is 60, while the sum is 23.
The spelling of 1115116112111 in words is "one trillion, one hundred fifteen billion, one hundred sixteen million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •