1105000101141 has 32 divisors (see below), whose sum is σ = 1509042769920. Its totient is φ = 719018006784.

The previous prime is 1105000101131. The next prime is 1105000101169. The reversal of 1105000101141 is 1411010005011.

It is not a de Polignac number, because 1105000101141 - 2¹⁴ = 1105000084757 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1105000101141.

It is a congruent number.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 96728956 + ... + 96740378.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 15865.

The product of its (nonzero) digits is 20, while the sum is 15.

Adding to 1105000101141 its reverse (1411010005011), we get a palindrome (2516010106152).

The spelling of 1105000101141 in words is "one trillion, one hundred five billion, one hundred one thousand, one hundred forty-one".