Search a number
-
+
155043130237 is a prime number
BaseRepresentation
bin1001000001100101001…
…0100110101101111101
3112211012020000001222221
42100121102212231331
510020012020131422
6155120440205341
714126053601602
oct2203122465575
9484166001887
10155043130237
115a831894586
122606b769851
131180b32c5a8
14770b47c6a9
1540767053c7
hex24194a6b7d

155043130237 has 2 divisors, whose sum is σ = 155043130238. Its totient is φ = 155043130236.

The previous prime is 155043130211. The next prime is 155043130267. The reversal of 155043130237 is 732031340551.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 152142122916 + 2901007321 = 390054^2 + 53861^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2155043130237 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 37800, while the sum is 34.

Adding to 155043130237 its reverse (732031340551), we get a palindrome (887074470788).

The spelling of 155043130237 in words is "one hundred fifty-five billion, forty-three million, one hundred thirty thousand, two hundred thirty-seven".