105611105611069 has 2 divisors, whose sum is σ = 105611105611070. Its totient is φ = 105611105611068.

The previous prime is 105611105610961. The next prime is 105611105611087. The reversal of 105611105611069 is 960116501116501.

Together with previous prime (105611105610961) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 83057012327844 + 22554093283225 = 9113562^2 + 4749115^2 .

It is a cyclic number.

It is not a de Polignac number, because 105611105611069 - 2¹¹ = 105611105609021 is a prime.

It is a super-2 number, since 2×105611105611069² (a number of 29 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (105611105618069) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52805552805534 + 52805552805535.

It is an arithmetic number, because the mean of its divisors is an integer number (52805552805535).

Almost surely, 2^{105611105611069} is an apocalyptic number.

It is an amenable number.

105611105611069 is a deficient number, since it is larger than the sum of its proper divisors (1).

105611105611069 is an equidigital number, since it uses as much as digits as its factorization.

105611105611069 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 48600, while the sum is 43.

The spelling of 105611105611069 in words is "one hundred five trillion, six hundred eleven billion, one hundred five million, six hundred eleven thousand, sixty-nine".