Search a number
-
+
110330302013 is a prime number
BaseRepresentation
bin110011011000000110…
…0101100111000111101
3101112210002221001112222
41212300030230320331
53301424024131023
6122403545135125
710654042044041
oct1466014547075
9345702831488
10110330302013
1142877640988
121947148a4a5
13a533a77299
1454a9004021
152d0b0decc8
hex19b032ce3d

110330302013 has 2 divisors, whose sum is σ = 110330302014. Its totient is φ = 110330302012.

The previous prime is 110330301941. The next prime is 110330302037. The reversal of 110330302013 is 310203033011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 91713882649 + 18616419364 = 302843^2 + 136442^2 .

It is a cyclic number.

It is not a de Polignac number, because 110330302013 - 210 = 110330300989 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2110330302013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 162, while the sum is 17.

Adding to 110330302013 its reverse (310203033011), we get a palindrome (420533335024).

The spelling of 110330302013 in words is "one hundred ten billion, three hundred thirty million, three hundred two thousand, thirteen".