105611661561050 has 24 divisors (see below), whose sum is σ = 197057367790236. Its totient is φ = 42111400691840.

The previous prime is 105611661561011. The next prime is 105611661561053. The reversal of 105611661561050 is 50165166116501.

It can be written as a sum of positive squares in 6 ways, for example, as 1091893333969 + 104519768227081 = 1044937^2 + 10223491^2 .

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

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

It is not an unprimeable number, because it can be changed into a prime (105611661561053) 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 in 11 ways as a sum of consecutive naturals, for example, 3331582307 + ... + 3331614006.

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

105611661561050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

105611661561050 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 6663196642 (or 6663196637 counting only the distinct ones).

The product of its (nonzero) digits is 162000, while the sum is 44.

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