141109607 has 2 divisors, whose sum is σ = 141109608. Its totient is φ = 141109606.

The previous prime is 141109583. The next prime is 141109609. The reversal of 141109607 is 706901141.

It is a strong prime.

It is an emirp because it is prime and its reverse (706901141) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 141109607 - 2⁸ = 141109351 is a prime.

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 141109607.

It is a congruent number.

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

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

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

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

Almost surely, 2^141109607 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 29.

The square root of 141109607 is about 11878.9564777383. The cubic root of 141109607 is about 520.6176179726.

The spelling of 141109607 in words is "one hundred forty-one million, one hundred nine thousand, six hundred seven".