Search a number
-
+
153302104602313 is a prime number
BaseRepresentation
bin100010110110110101101101…
…011111001111011011001001
3202002210112112020211222020121
4202312311231133033123021
5130043200202234233223
61302014003053423241
744201466030566002
oct4266655537173311
9662715466758217
10153302104602313
114493506a51a097
121523ab8479ab21
136770432237314
1429bdc0bb7c1a9
1512acb15ea815d
hex8b6d6d7cf6c9

153302104602313 has 2 divisors, whose sum is σ = 153302104602314. Its totient is φ = 153302104602312.

The previous prime is 153302104602223. The next prime is 153302104602329. The reversal of 153302104602313 is 313206401203351.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 134660892505104 + 18641212097209 = 11604348^2 + 4317547^2 .

It is a cyclic number.

It is not a de Polignac number, because 153302104602313 - 241 = 151103081346761 is a prime.

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

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

Almost surely, 2153302104602313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 38880, while the sum is 34.

Adding to 153302104602313 its reverse (313206401203351), we get a palindrome (466508505805664).

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