Search a number
-
+
145391 is a prime number
BaseRepresentation
bin100011011111101111
321101102212
4203133233
514123031
63041035
71143611
oct433757
9241385
10145391
119a264
127017b
135123c
143adb1
152d12b
hex237ef

145391 has 2 divisors, whose sum is σ = 145392. Its totient is φ = 145390.

The previous prime is 145381. The next prime is 145399. The reversal of 145391 is 193541.

It is a happy number.

It is a strong prime.

It is an emirp because it is prime and its reverse (193541) is a distict prime.

It is a cyclic number.

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

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

It is a Chen prime.

It is a plaindrome in base 16.

It is a congruent number.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 145391.

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

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

It is a good prime.

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

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

2145391 is an apocalyptic number.

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

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

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

The product of its digits is 540, while the sum is 23.

The square root of 145391 is about 381.3017178036. The cubic root of 145391 is about 52.5830582478.

The spelling of 145391 in words is "one hundred forty-five thousand, three hundred ninety-one".