Search a number
-
+
145500071 is a prime number
BaseRepresentation
bin10001010110000…
…10011110100111
3101010210011120112
420223002132213
5244222000241
622234323235
73414505313
oct1053023647
9333704515
10145500071
11751493a2
124088951b
13241b4922
1415476b43
15cb911eb
hex8ac27a7

145500071 has 2 divisors, whose sum is σ = 145500072. Its totient is φ = 145500070.

The previous prime is 145500029. The next prime is 145500073. The reversal of 145500071 is 170005541.

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

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 145500071 - 26 = 145500007 is a prime.

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

Together with 145500073, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2145500071 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 700, while the sum is 23.

The square root of 145500071 is about 12062.3410248591. The cubic root of 145500071 is about 525.9620407098.

The spelling of 145500071 in words is "one hundred forty-five million, five hundred thousand, seventy-one".