14050691 has 2 divisors, whose sum is σ = 14050692. Its totient is φ = 14050690.

The previous prime is 14050651. The next prime is 14050693. The reversal of 14050691 is 19605041.

14050691 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 is an emirp because it is prime and its reverse (19605041) is a distict prime.

It is a cyclic number.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is equal to p₉₁₃₁₃₉ and since 14050691 and 913139 have the same sum of digits, it is a Honaker prime.

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

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

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

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

Almost surely, 2^14050691 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 26.

The square root of 14050691 is about 3748.4251359738. The cubic root of 14050691 is about 241.3047629982.

It can be divided in two parts, 14050 and 691, that added together give a palindrome (14741).

The spelling of 14050691 in words is "fourteen million, fifty thousand, six hundred ninety-one".