Search a number
-
+
110034152513 is a prime number
BaseRepresentation
bin110011001111010001…
…0111110110001000001
3101112000110200002210222
41212132202332301001
53300322220340023
6122314325432425
710643514602315
oct1463642766101
9345013602728
10110034152513
114273545742a
12193aa26b715
13a4b75c6cac
14547b953b45
152ce00e1cc8
hex199e8bec41

110034152513 has 2 divisors, whose sum is σ = 110034152514. Its totient is φ = 110034152512.

The previous prime is 110034152419. The next prime is 110034152531. The reversal of 110034152513 is 315251430011.

Together with next prime (110034152531) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 59773893169 + 50260259344 = 244487^2 + 224188^2 .

It is a cyclic number.

It is not a de Polignac number, because 110034152513 - 212 = 110034148417 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 2110034152513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1800, while the sum is 26.

Adding to 110034152513 its reverse (315251430011), we get a palindrome (425285582524).

The spelling of 110034152513 in words is "one hundred ten billion, thirty-four million, one hundred fifty-two thousand, five hundred thirteen".