Search a number
-
+
153651716246213 is a prime number
BaseRepresentation
bin100010111011111011010011…
…111101110100101011000101
3202011000221221021211122012022
4202323323103331310223011
5130114412203324334323
61302442342440332525
744235653523536513
oct4273732375645305
9664027837748168
10153651716246213
1144a5a366146789
1215296894a74145
1367973aa510223
1429d2ad5bdb4b3
1512b6c78d984c8
hex8bbed3f74ac5

153651716246213 has 2 divisors, whose sum is σ = 153651716246214. Its totient is φ = 153651716246212.

The previous prime is 153651716246191. The next prime is 153651716246239. The reversal of 153651716246213 is 312642617156351.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 102574723014724 + 51076993231489 = 10127918^2 + 7146817^2 .

It is a cyclic number.

It is not a de Polignac number, because 153651716246213 - 214 = 153651716229829 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2153651716246213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 5443200, while the sum is 53.

The spelling of 153651716246213 in words is "one hundred fifty-three trillion, six hundred fifty-one billion, seven hundred sixteen million, two hundred forty-six thousand, two hundred thirteen".