Search a number
-
+
110110500107 is a prime number
BaseRepresentation
bin110011010001100011…
…0001110010100001011
3101112012210022222000122
41212203012032110023
53301001242000412
6122330054053455
710645432544126
oct1464306162413
9345183288018
10110110500107
1142774563513
121940b94a28b
13a4ca378a9a
145487b493bd
152ce6b73572
hex19a318e50b

110110500107 has 2 divisors, whose sum is σ = 110110500108. Its totient is φ = 110110500106.

The previous prime is 110110500091. The next prime is 110110500109. The reversal of 110110500107 is 701005011011.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110110500107 - 24 = 110110500091 is a prime.

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

Together with 110110500109, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 2110110500107 is an apocalyptic number.

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

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

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

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

Adding to 110110500107 its reverse (701005011011), we get a palindrome (811115511118).

The spelling of 110110500107 in words is "one hundred ten billion, one hundred ten million, five hundred thousand, one hundred seven".