Search a number
-
+
155237153153 is a prime number
BaseRepresentation
bin1001000010010011011…
…0101111100110000001
3112211200202002110101212
42100210312233212001
510020411202400103
6155152010535505
714133631013225
oct2204466574601
9484622073355
10155237153153
115a9213648a5
1226104737595
131183c5a3154
147729146785
15408877d7d8
hex2424daf981

155237153153 has 2 divisors, whose sum is σ = 155237153154. Its totient is φ = 155237153152.

The previous prime is 155237153119. The next prime is 155237153171. The reversal of 155237153153 is 351351732551.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 146989425664 + 8247727489 = 383392^2 + 90817^2 .

It is a cyclic number.

It is not a de Polignac number, because 155237153153 - 218 = 155236891009 is a prime.

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

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

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

Almost surely, 2155237153153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 236250, while the sum is 41.

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