Search a number
-
+
153055624213 is a prime number
BaseRepresentation
bin1000111010001011010…
…0110111110000010101
3112122001201011022021201
42032202310313300111
510001424214433323
6154151321112501
714025601224442
oct2164264676025
9478051138251
10153055624213
1159a01a00918
12257b6028731
131158263b01b
14759d5169c9
153eabeae8ad
hex23a2d37c15

153055624213 has 2 divisors, whose sum is σ = 153055624214. Its totient is φ = 153055624212.

The previous prime is 153055624181. The next prime is 153055624217. The reversal of 153055624213 is 312426550351.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 132595754769 + 20459869444 = 364137^2 + 143038^2 .

It is an emirp because it is prime and its reverse (312426550351) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 153055624213 - 25 = 153055624181 is a prime.

It is a congruent number.

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

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

Almost surely, 2153055624213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108000, while the sum is 37.

The spelling of 153055624213 in words is "one hundred fifty-three billion, fifty-five million, six hundred twenty-four thousand, two hundred thirteen".