1011209141 has 2 divisors, whose sum is σ = 1011209142. Its totient is φ = 1011209140.

The previous prime is 1011209107. The next prime is 1011209197. The reversal of 1011209141 is 1419021101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 765628900 + 245580241 = 27670^2 + 15671^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1011209041) 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, 505604570 + 505604571.

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

Almost surely, 2^1011209141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1011209141 is about 31799.5147918958. The cubic root of 1011209141 is about 1003.7225060874.

The spelling of 1011209141 in words is "one billion, eleven million, two hundred nine thousand, one hundred forty-one".