Search a number
145709 is a prime number
BaseRepresentation
bin100011100100101101
321101212122
4203210231
514130314
63042325
71144544
oct434455
9241778
10145709
119a523
12703a5
1351425
143b15b
152d28e
hex2392d

145709 has 2 divisors, whose sum is σ = 145710. Its totient is φ = 145708.

The previous prime is 145703. The next prime is 145721. The reversal of 145709 is 907541.

145709 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 103684 + 42025 = 322^2 + 205^2 .

It is a cyclic number.

It is not a de Polignac number, because 145709 - 212 = 141613 is a prime.

It is a super-2 number, since 2×1457092 = 42462225362, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Chen prime.

It is an Ulam number.

It is a Curzon number.

It is a congruent number.

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

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

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

2145709 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 145709 is about 381.7184826544. The cubic root of 145709 is about 52.6213669836.

The spelling of 145709 in words is "one hundred forty-five thousand, seven hundred nine".