Search a number
-
+
330030320301113 is a prime number
BaseRepresentation
bin100101100001010010010110…
…0000000011011010000111001
31121021112120221110122020020112
41023002210230000123100321
5321224204043444113423
63125525500332434105
7126341621666366525
oct11302445400332071
91537476843566215
10330030320301113
1196181088a34573
1231022106618935
131121c958394433
145b6d7a49a6d85
152824ca5430a78
hex12c292c01b439

330030320301113 has 2 divisors, whose sum is σ = 330030320301114. Its totient is φ = 330030320301112.

The previous prime is 330030320301047. The next prime is 330030320301163. The reversal of 330030320301113 is 311103023030033.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 307265560536064 + 22764759765049 = 17528992^2 + 4771243^2 .

It is a cyclic number.

It is not a de Polignac number, because 330030320301113 - 212 = 330030320297017 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2330030320301113 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 330030320301113 its reverse (311103023030033), we get a palindrome (641133343331146).

The spelling of 330030320301113 in words is "three hundred thirty trillion, thirty billion, three hundred twenty million, three hundred one thousand, one hundred thirteen".