12000110141 has 2 divisors, whose sum is σ = 12000110142. Its totient is φ = 12000110140.

The previous prime is 12000110113. The next prime is 12000110153. The reversal of 12000110141 is 14101100021.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11501704516 + 498405625 = 107246^2 + 22325^2 .

It is a cyclic number.

It is not a de Polignac number, because 12000110141 - 2¹⁰ = 12000109117 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2^12000110141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 12000110141 its reverse (14101100021), we get a palindrome (26101210162).

The spelling of 12000110141 in words is "twelve billion, one hundred ten thousand, one hundred forty-one".