105611105611051 has 4 divisors (see below), whose sum is σ = 109017915469504. Its totient is φ = 102204295752600.

The previous prime is 105611105610961. The next prime is 105611105611069. The reversal of 105611105611051 is 150116501116501.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 105611105611051 - 2⁹ = 105611105610539 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 105611105610998 and 105611105611016.

It is not an unprimeable number, because it can be changed into a prime (105611105011051) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1703404929180 + ... + 1703404929241.

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

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

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

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

105611105611051 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3406809858452.

The product of its (nonzero) digits is 4500, while the sum is 34.

Adding to 105611105611051 its reverse (150116501116501), we get a palindrome (255727606727552).

The spelling of 105611105611051 in words is "one hundred five trillion, six hundred eleven billion, one hundred five million, six hundred eleven thousand, fifty-one".