Search a number
-
+
156551513 is a prime number
BaseRepresentation
bin10010101010011…
…00100101011001
3101220120122022012
421111030211121
5310034122023
623311235305
73610444256
oct1125144531
9356518265
10156551513
1180407518
1244518b35
1326583c41
1416b1242d
15db25978
hex954c959

156551513 has 2 divisors, whose sum is σ = 156551514. Its totient is φ = 156551512.

The previous prime is 156551497. The next prime is 156551531. The reversal of 156551513 is 315155651.

Together with next prime (156551531) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 156550144 + 1369 = 12512^2 + 37^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 156551513 - 24 = 156551497 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 156551513.

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

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

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

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

Almost surely, 2156551513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 11250, while the sum is 32.

The square root of 156551513 is about 12512.0547073612. The cubic root of 156551513 is about 538.9548979372.

The spelling of 156551513 in words is "one hundred fifty-six million, five hundred fifty-one thousand, five hundred thirteen".