10960071141 has 16 divisors (see below), whose sum is σ = 14929843968. Its totient is φ = 7148620800.

The previous prime is 10960071137. The next prime is 10960071151. The reversal of 10960071141 is 14117006901.

10960071141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 10960071141 - 2² = 10960071137 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2^10960071141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 28652.

The product of its (nonzero) digits is 1512, while the sum is 30.

The spelling of 10960071141 in words is "ten billion, nine hundred sixty million, seventy-one thousand, one hundred forty-one".