10990559141 has 2 divisors, whose sum is σ = 10990559142. Its totient is φ = 10990559140.

The previous prime is 10990559137. The next prime is 10990559197. The reversal of 10990559141 is 14195509901.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7859709025 + 3130850116 = 88655^2 + 55954^2 .

It is a cyclic number.

It is not a de Polignac number, because 10990559141 - 2² = 10990559137 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10990559441) 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 as a sum of consecutive naturals, namely, 5495279570 + 5495279571.

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

Almost surely, 2^10990559141 is an apocalyptic number.

It is an amenable number.

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

10990559141 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 72900, while the sum is 44.

The spelling of 10990559141 in words is "ten billion, nine hundred ninety million, five hundred fifty-nine thousand, one hundred forty-one".