110656713100641 has 32 divisors (see below), whose sum is σ = 151972426881408. Its totient is φ = 71567731699200.

The previous prime is 110656713100601. The next prime is 110656713100643. The reversal of 110656713100641 is 146001317656011.

It is not a de Polignac number, because 110656713100641 - 2²⁶ = 110656645991777 is a prime.

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

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

It is not an unprimeable number, because it can be changed into a prime (110656713100643) 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 31 ways as a sum of consecutive naturals, for example, 1632046941 + ... + 1632114741.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 110561.

The product of its (nonzero) digits is 90720, while the sum is 42.

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