Search a number
-
+
330263232533099 is a prime number
BaseRepresentation
bin100101100010111110110011…
…0101010000101001001101011
31121022100212010112002112100222
41023011331212222011021223
5321242013100012024344
63130224500130120255
7126364505531606615
oct11305754652051153
91538325115075328
10330263232533099
1196260939902798
123105b28842008b
13112388c620cb98
145b7ab7bbaddb5
15282ad87ed75ee
hex12c5f66a8526b

330263232533099 has 2 divisors, whose sum is σ = 330263232533100. Its totient is φ = 330263232533098.

The previous prime is 330263232533051. The next prime is 330263232533111. The reversal of 330263232533099 is 990335232362033.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 330263232533099 - 212 = 330263232529003 is a prime.

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

It is a Sophie Germain prime.

It is a self number, because there is not a number n which added to its sum of digits gives 330263232533099.

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

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

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

Almost surely, 2330263232533099 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 14171760, while the sum is 53.

The spelling of 330263232533099 in words is "three hundred thirty trillion, two hundred sixty-three billion, two hundred thirty-two million, five hundred thirty-three thousand, ninety-nine".