Base | Representation |
---|---|
bin | 10011000101000100100… |
… | …111101000011010000011 |
3 | 11122100012221120020012001 |
4 | 103011010213220122003 |
5 | 132440131230440331 |
6 | 2442152443444431 |
7 | 163503453241453 |
oct | 23050447503203 |
9 | 4570187506161 |
10 | 1311116265091 |
11 | 46604aa50736 |
12 | 19212a226717 |
13 | 9683a13b9a9 |
14 | 4765ba81d63 |
15 | 24189ccd561 |
hex | 131449e8683 |
1311116265091 has 2 divisors, whose sum is σ = 1311116265092. Its totient is φ = 1311116265090.
The previous prime is 1311116265083. The next prime is 1311116265133. The reversal of 1311116265091 is 1905626111131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1311116265091 - 23 = 1311116265083 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1311116265091.
It is not a weakly prime, because it can be changed into another prime (1311116265001) 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, 655558132545 + 655558132546.
It is an arithmetic number, because the mean of its divisors is an integer number (655558132546).
Almost surely, 21311116265091 is an apocalyptic number.
1311116265091 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311116265091 is an equidigital number, since it uses as much as digits as its factorization.
1311116265091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 37.
The spelling of 1311116265091 in words is "one trillion, three hundred eleven billion, one hundred sixteen million, two hundred sixty-five thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •