Search a number
-
+
153301623650017 is a prime number
BaseRepresentation
bin100010110110110101010000…
…110100100011011011100001
3202002210111021201212001201121
4202312311100310203123201
5130043143211123300032
61302013443233132241
744201451100553503
oct4266652064433341
9662714251761647
10153301623650017
1144934942a92557
121523aa6b6ba081
1367703866c106b
1429bdba3d43d73
1512acad8b53a97
hex8b6d50d236e1

153301623650017 has 2 divisors, whose sum is σ = 153301623650018. Its totient is φ = 153301623650016.

The previous prime is 153301623649991. The next prime is 153301623650051. The reversal of 153301623650017 is 710056326103351.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 107552849651361 + 45748773998656 = 10370769^2 + 6763784^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-153301623650017 is a prime.

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

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

Almost surely, 2153301623650017 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 340200, while the sum is 43.

Adding to 153301623650017 its reverse (710056326103351), we get a palindrome (863357949753368).

The spelling of 153301623650017 in words is "one hundred fifty-three trillion, three hundred one billion, six hundred twenty-three million, six hundred fifty thousand, seventeen".