Search a number
-
+
330110323213001 is a prime number
BaseRepresentation
bin100101100001110111100110…
…0100011010100001011001001
31121021211020110000020020121012
41023003233030203110023021
5321232011420220304001
63130030331112453305
7126350453355046562
oct11303571443241311
91537736400206535
10330110323213001
119620200254a371
12310357133aa235
1311227367ca8756
145b735d3c9d169
152826dd8cc72bb
hex12c3bcc8d42c9

330110323213001 has 2 divisors, whose sum is σ = 330110323213002. Its totient is φ = 330110323213000.

The previous prime is 330110323212997. The next prime is 330110323213019. The reversal of 330110323213001 is 100312323011033.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 242765971740601 + 87344351472400 = 15580949^2 + 9345820^2 .

It is a cyclic number.

It is not a de Polignac number, because 330110323213001 - 22 = 330110323212997 is a prime.

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

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

Almost surely, 2330110323213001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 23.

Adding to 330110323213001 its reverse (100312323011033), we get a palindrome (430422646224034).

The spelling of 330110323213001 in words is "three hundred thirty trillion, one hundred ten billion, three hundred twenty-three million, two hundred thirteen thousand, one".