105611105610961 has 2 divisors, whose sum is σ = 105611105610962. Its totient is φ = 105611105610960.

The previous prime is 105611105610943. The next prime is 105611105611069. The reversal of 105611105610961 is 169016501116501.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 58688331610561 + 46922774000400 = 7660831^2 + 6850020^2 .

It is a cyclic number.

It is not a de Polignac number, because 105611105610961 - 2⁹ = 105611105610449 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

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

It is an amenable number.

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

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

105611105610961 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 105611105610961 in words is "one hundred five trillion, six hundred eleven billion, one hundred five million, six hundred ten thousand, nine hundred sixty-one".