145369709 has 2 divisors, whose sum is σ = 145369710. Its totient is φ = 145369708.

The previous prime is 145369691. The next prime is 145369711. The reversal of 145369709 is 907963541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 109788484 + 35581225 = 10478^2 + 5965^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×145369709² = 42264704589489362, which contains 22 as substring.

Together with 145369711, 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 145369709.

It is a congruent number.

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

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

Almost surely, 2^145369709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 204120, while the sum is 44.

The square root of 145369709 is about 12056.9361365149. The cubic root of 145369709 is about 525.8049137510.

The spelling of 145369709 in words is "one hundred forty-five million, three hundred sixty-nine thousand, seven hundred nine".