195911141 has 2 divisors, whose sum is σ = 195911142. Its totient is φ = 195911140.

The previous prime is 195911137. The next prime is 195911143. The reversal of 195911141 is 141119591.

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., 145202500 + 50708641 = 12050^2 + 7121^2 .

It is a cyclic number.

It is not a de Polignac number, because 195911141 - 2² = 195911137 is a prime.

It is a Sophie Germain prime.

Together with 195911143, it forms a pair of twin primes.

It is a Chen prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 2^195911141 is an apocalyptic number.

It is an amenable number.

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

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

195911141 is an evil number, because the sum of its binary digits is even.

The product of its digits is 1620, while the sum is 32.

The square root of 195911141 is about 13996.8261045138. The cubic root of 195911141 is about 580.7907772825.

The spelling of 195911141 in words is "one hundred ninety-five million, nine hundred eleven thousand, one hundred forty-one".