Search a number
-
+
155410201157 is a prime number
BaseRepresentation
bin1001000010111100101…
…0110111101001000101
3112212010210201012122012
42100233022313221011
510021240002414112
6155221111544005
714141131625321
oct2205712675105
9485123635565
10155410201157
115aa00009382
122615268b005
13118693b1913
147744110981
154098a62022
hex242f2b7a45

155410201157 has 2 divisors, whose sum is σ = 155410201158. Its totient is φ = 155410201156.

The previous prime is 155410201127. The next prime is 155410201283. The reversal of 155410201157 is 751102014551.

155410201157 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., 137526755716 + 17883445441 = 370846^2 + 133729^2 .

It is a cyclic number.

It is not a de Polignac number, because 155410201157 - 222 = 155406006853 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (155410201127) 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, 77705100578 + 77705100579.

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

Almost surely, 2155410201157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7000, while the sum is 32.

The spelling of 155410201157 in words is "one hundred fifty-five billion, four hundred ten million, two hundred one thousand, one hundred fifty-seven".