Base | Representation |
---|---|
bin | 11111101100101010011… |
… | …10111001011000001111 |
3 | 10212010020101001201012102 |
4 | 33312111032321120033 |
5 | 120321014342423421 |
6 | 2152201205025315 |
7 | 141454444646624 |
oct | 17662516713017 |
9 | 3763211051172 |
10 | 1089130436111 |
11 | 38a996812843 |
12 | 1570b76b523b |
13 | 7b920bbca73 |
14 | 3a9dda6c34b |
15 | 1d4e65c960b |
hex | fd953b960f |
1089130436111 has 2 divisors, whose sum is σ = 1089130436112. Its totient is φ = 1089130436110.
The previous prime is 1089130436081. The next prime is 1089130436137. The reversal of 1089130436111 is 1116340319801.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1089130436111 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 (1089130436711) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 544565218055 + 544565218056.
It is an arithmetic number, because the mean of its divisors is an integer number (544565218056).
Almost surely, 21089130436111 is an apocalyptic number.
1089130436111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1089130436111 is an equidigital number, since it uses as much as digits as its factorization.
1089130436111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 38.
The spelling of 1089130436111 in words is "one trillion, eighty-nine billion, one hundred thirty million, four hundred thirty-six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •