145900691 has 2 divisors, whose sum is σ = 145900692. Its totient is φ = 145900690.

The previous prime is 145900627. The next prime is 145900697. The reversal of 145900691 is 196009541.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 145900691 - 2⁶ = 145900627 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

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

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

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

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

Almost surely, 2^145900691 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 9720, while the sum is 35.

The square root of 145900691 is about 12078.9358388891. The cubic root of 145900691 is about 526.4443264252. Note that the first 3 decimals are identical.

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