Search a number
-
+
156861154537 is a prime number
BaseRepresentation
bin1001001000010110100…
…1110100010011101001
3112222212220221021111021
42102011221310103221
510032222423421122
6200021102532441
714222110546153
oct2220551642351
9488786837437
10156861154537
116058503a0aa
1226498597121
1311a3ab90709
147840ac7ad3
15413111e1c7
hex2485a744e9

156861154537 has 2 divisors, whose sum is σ = 156861154538. Its totient is φ = 156861154536.

The previous prime is 156861154523. The next prime is 156861154573. The reversal of 156861154537 is 735451168651.

Together with next prime (156861154573) 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., 150547104016 + 6314050521 = 388004^2 + 79461^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2156861154537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3024000, while the sum is 52.

The spelling of 156861154537 in words is "one hundred fifty-six billion, eight hundred sixty-one million, one hundred fifty-four thousand, five hundred thirty-seven".