Base | Representation |
---|---|
bin | 10000001001110001110… |
… | …101000111011101110011 |
3 | 10221010010121010002222121 |
4 | 100021301311013131303 |
5 | 121141300343440422 |
6 | 2205533202415111 |
7 | 143124054322024 |
oct | 20116165073563 |
9 | 3833117102877 |
10 | 1110011311987 |
11 | 3988314a1956 |
12 | 15b164661497 |
13 | 8089ac26516 |
14 | 3ba20d32c4b |
15 | 1dd198458c7 |
hex | 10271d47773 |
1110011311987 has 2 divisors, whose sum is σ = 1110011311988. Its totient is φ = 1110011311986.
The previous prime is 1110011311963. The next prime is 1110011312021. The reversal of 1110011311987 is 7891131100111.
It is an a-pointer prime, because the next prime (1110011312021) can be obtained adding 1110011311987 to its sum of digits (34).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1110011311987 - 227 = 1109877094259 is a prime.
It is a super-2 number, since 2×11100113119872 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1110011321987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555005655993 + 555005655994.
It is an arithmetic number, because the mean of its divisors is an integer number (555005655994).
Almost surely, 21110011311987 is an apocalyptic number.
1110011311987 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110011311987 is an equidigital number, since it uses as much as digits as its factorization.
1110011311987 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 34.
The spelling of 1110011311987 in words is "one trillion, one hundred ten billion, eleven million, three hundred eleven thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.041 sec. • engine limits •