110051555510641 has 48 divisors (see below), whose sum is σ = 118976389136640. Its totient is φ = 101510415639360.

The previous prime is 110051555510629. The next prime is 110051555510719. The reversal of 110051555510641 is 146015555150011.

It is not a de Polignac number, because 110051555510641 - 2¹⁷ = 110051555379569 is a prime.

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

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

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

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

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

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

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 75000, while the sum is 40.

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