Search a number
-
+
330110321023103 is a prime number
BaseRepresentation
bin100101100001110111100110…
…0011010111101100001111111
31121021211020102212002222121212
41023003233030122331201333
5321232011414140214403
63130030330553515035
7126350453330326205
oct11303571432754177
91537736385088555
10330110321023103
1196202001294035
1231035712712a7b
13112273676bca5a
145b735d388d075
152826dd89e34d8
hex12c3bcc6bd87f

330110321023103 has 2 divisors, whose sum is σ = 330110321023104. Its totient is φ = 330110321023102.

The previous prime is 330110321023037. The next prime is 330110321023123. The reversal of 330110321023103 is 301320123011033.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 330110321023103 - 220 = 330110319974527 is a prime.

It is a super-2 number, since 2×3301103210231032 (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 (330110321023123) 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, 165055160511551 + 165055160511552.

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

Almost surely, 2330110321023103 is an apocalyptic number.

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

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

330110321023103 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 330110321023103 its reverse (301320123011033), we get a palindrome (631430444034136).

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