Search a number
-
+
145709371 is a prime number
BaseRepresentation
bin10001010111101…
…01100100111011
3101011011210200101
420223311210323
5244300144441
622243020231
73416336443
oct1053654473
9334153611
10145709371
1175281675
124096a677
1324258c82
14154cd123
15cbd3231
hex8af593b

145709371 has 2 divisors, whose sum is σ = 145709372. Its totient is φ = 145709370.

The previous prime is 145709359. The next prime is 145709381. The reversal of 145709371 is 173907541.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 145709371 - 25 = 145709339 is a prime.

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 145709371.

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

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

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

Almost surely, 2145709371 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 26460, while the sum is 37.

The square root of 145709371 is about 12071.0136691166. The cubic root of 145709371 is about 526.2141164460.

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