Search a number
-
+
110005115351 is a prime number
BaseRepresentation
bin110011001110011010…
…0001101100111010111
3101111221110000212022112
41212130310031213113
53300242302142401
6122311411221235
710643013024005
oct1463464154727
9344843025275
10110005115351
114272002437a
12193a05a781b
13a4b159b341
145477b55a75
152cdc7a83bb
hex199cd0d9d7

110005115351 has 2 divisors, whose sum is σ = 110005115352. Its totient is φ = 110005115350.

The previous prime is 110005115333. The next prime is 110005115357. The reversal of 110005115351 is 153511500011.

It is a strong prime.

It is an emirp because it is prime and its reverse (153511500011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 110005115351 - 26 = 110005115287 is a prime.

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

It is a Sophie Germain prime.

It is a congruent number.

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

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

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

Almost surely, 2110005115351 is an apocalyptic number.

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

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

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

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

Adding to 110005115351 its reverse (153511500011), we get a palindrome (263516615362).

The spelling of 110005115351 in words is "one hundred ten billion, five million, one hundred fifteen thousand, three hundred fifty-one".