Base | Representation |
---|---|
bin | 10000001000111011100… |
… | …100100101100011000011 |
3 | 10221000210011012221011112 |
4 | 100020323210211203003 |
5 | 121132414324242331 |
6 | 2205303003433535 |
7 | 143062362012515 |
oct | 20107344454303 |
9 | 3830704187145 |
10 | 1109101009091 |
11 | 398404672909 |
12 | 15ab4b8258ab |
13 | 8078446345a |
14 | 3b976093bb5 |
15 | 1dcb498132b |
hex | 1023b9258c3 |
1109101009091 has 2 divisors, whose sum is σ = 1109101009092. Its totient is φ = 1109101009090.
The previous prime is 1109101009063. The next prime is 1109101009109. The reversal of 1109101009091 is 1909001019011.
Together with next prime (1109101009109) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1109101009091 is a prime.
It is not a weakly prime, because it can be changed into another prime (1109101009591) 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, 554550504545 + 554550504546.
It is an arithmetic number, because the mean of its divisors is an integer number (554550504546).
Almost surely, 21109101009091 is an apocalyptic number.
1109101009091 is a deficient number, since it is larger than the sum of its proper divisors (1).
1109101009091 is an equidigital number, since it uses as much as digits as its factorization.
1109101009091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 32.
The spelling of 1109101009091 in words is "one trillion, one hundred nine billion, one hundred one million, nine thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •