110100010010141 has 2 divisors, whose sum is σ = 110100010010142. Its totient is φ = 110100010010140.

The previous prime is 110100010010101. The next prime is 110100010010147. The reversal of 110100010010141 is 141010010001011.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 66559147907641 + 43540862102500 = 8158379^2 + 6598550^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-110100010010141 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (110100010010147) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050005005070 + 55050005005071.

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 110100010010141 its reverse (141010010001011), we get a palindrome (251110020011152).

The spelling of 110100010010141 in words is "one hundred ten trillion, one hundred billion, ten million, ten thousand, one hundred forty-one".