Base | Representation |
---|---|
bin | 10000000110100001100… |
… | …000100101100000100011 |
3 | 10220210010000120112110102 |
4 | 100012201200211200203 |
5 | 121112121131102331 |
6 | 2204154311453015 |
7 | 142641335046422 |
oct | 20064140454043 |
9 | 3823100515412 |
10 | 1106516269091 |
11 | 3972a8650452 |
12 | 15a54a08716b |
13 | 80461b042bc |
14 | 3b7acaa52b9 |
15 | 1dbb2ab74cb |
hex | 101a1825823 |
1106516269091 has 2 divisors, whose sum is σ = 1106516269092. Its totient is φ = 1106516269090.
The previous prime is 1106516269051. The next prime is 1106516269127. The reversal of 1106516269091 is 1909626156011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1106516269091 - 226 = 1106449160227 is a prime.
It is a super-3 number, since 3×11065162690913 (a number of 37 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1106516269031) 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, 553258134545 + 553258134546.
It is an arithmetic number, because the mean of its divisors is an integer number (553258134546).
Almost surely, 21106516269091 is an apocalyptic number.
1106516269091 is a deficient number, since it is larger than the sum of its proper divisors (1).
1106516269091 is an equidigital number, since it uses as much as digits as its factorization.
1106516269091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 47.
The spelling of 1106516269091 in words is "one trillion, one hundred six billion, five hundred sixteen million, two hundred sixty-nine thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •