Search a number
-
+
323321312110127 is a prime number
BaseRepresentation
bin100100110000011110001101…
…1111101001110011000101111
31120101210012211011002202200012
41021200330123331032120233
5314334244021400011002
63103351432115323435
7125050123343604332
oct11140743375163057
91511705734082605
10323321312110127
1194024886798291
1230319a052b057b
1310b540b850a0a6
1459bab99368619
15275a4e1646d52
hex1260f1bf4e62f

323321312110127 has 2 divisors, whose sum is σ = 323321312110128. Its totient is φ = 323321312110126.

The previous prime is 323321312110051. The next prime is 323321312110157. The reversal of 323321312110127 is 721011213123323.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 323321312110127 - 28 = 323321312109871 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2323321312110127 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 9072, while the sum is 32.

The spelling of 323321312110127 in words is "three hundred twenty-three trillion, three hundred twenty-one billion, three hundred twelve million, one hundred ten thousand, one hundred twenty-seven".