10505611110051 has 48 divisors (see below), whose sum is σ = 16674491159040. Its totient is φ = 6344145244800.

The previous prime is 10505611110037. The next prime is 10505611110083. The reversal of 10505611110051 is 15001111650501.

10505611110051 is a `hidden beast` number, since 1 + 0 + 50 + 561 + 1 + 1 + 1 + 0 + 0 + 51 = 666.

It is not a de Polignac number, because 10505611110051 - 2⁵ = 10505611110019 is a prime.

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

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

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

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9509535 + ... + 10556631.

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

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

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

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

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

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

The product of its (nonzero) digits is 750, while the sum is 27.

Adding to 10505611110051 its reverse (15001111650501), we get a palindrome (25506722760552).

It can be divided in two parts, 1050561 and 1110051, that added together give a palindrome (2160612).

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