Search a number
-
+
323212230123151 is a prime number
BaseRepresentation
bin100100101111101011011011…
…0001010011101111010001111
31120101101210021001002200102111
41021133112312022131322033
5314331002121402420101
63103225352042004451
7125036212240164565
oct11137266612357217
91511353231080374
10323212230123151
1193a9259a862a26
1230300841aa6727
1310b46a23272775
1459b57ac06da35
152757759e38251
hex125f5b629de8f

323212230123151 has 2 divisors, whose sum is σ = 323212230123152. Its totient is φ = 323212230123150.

The previous prime is 323212230123067. The next prime is 323212230123203. The reversal of 323212230123151 is 151321032212323.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 323212230123151 - 213 = 323212230114959 is a prime.

It is a super-2 number, since 2×3232122301231512 (a number of 30 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 2323212230123151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 31.

Adding to 323212230123151 its reverse (151321032212323), we get a palindrome (474533262335474).

The spelling of 323212230123151 in words is "three hundred twenty-three trillion, two hundred twelve billion, two hundred thirty million, one hundred twenty-three thousand, one hundred fifty-one".