Search a number
-
+
552888130153 is a prime number
BaseRepresentation
bin10000000101110101011…
…00110101101001101001
31221212002201120002121211
420002322230311221221
533024303330131103
61101554315233121
754642040364542
oct10027254655151
91855081502554
10552888130153
111a3529a32477
128b1a11487a1
13401a2363848
141ca8d3594c9
15e5add2036d
hex80bab35a69

552888130153 has 2 divisors, whose sum is σ = 552888130154. Its totient is φ = 552888130152.

The previous prime is 552888130129. The next prime is 552888130183. The reversal of 552888130153 is 351031888255.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 384961925209 + 167926204944 = 620453^2 + 409788^2 .

It is a cyclic number.

It is not a de Polignac number, because 552888130153 - 25 = 552888130121 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 552888130097 and 552888130106.

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

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

Almost surely, 2552888130153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1152000, while the sum is 49.

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