Search a number
-
+
153336313662151 is a prime number
BaseRepresentation
bin100010110111010101100100…
…100000011100101011000111
3202002220210211100020021020211
4202313111210200130223013
5130044230232244142101
61302041421404340251
744204116540031224
oct4267254440345307
9662823740207224
10153336313662151
1144948624658074
1215245731244687
13677372462aa69
1429c17351da94b
1512ad9693a0c51
hex8b756481cac7

153336313662151 has 2 divisors, whose sum is σ = 153336313662152. Its totient is φ = 153336313662150.

The previous prime is 153336313662121. The next prime is 153336313662223. The reversal of 153336313662151 is 151266313633351.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 153336313662151 - 239 = 152786557848263 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2153336313662151 is an apocalyptic number.

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

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

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

The product of its digits is 2624400, while the sum is 49.

The spelling of 153336313662151 in words is "one hundred fifty-three trillion, three hundred thirty-six billion, three hundred thirteen million, six hundred sixty-two thousand, one hundred fifty-one".