Search a number
-
+
110165031113 is a prime number
BaseRepresentation
bin110011010011001011…
…0001111100011001001
3101112100120221102111112
41212212112033203021
53301104221443423
6122335322540105
710646664212504
oct1464626174311
9345316842445
10110165031113
11427a2319465
1219426067635
13a50875c657
1454910a213b
152ceb845a78
hex19a658f8c9

110165031113 has 2 divisors, whose sum is σ = 110165031114. Its totient is φ = 110165031112.

The previous prime is 110165031107. The next prime is 110165031143. The reversal of 110165031113 is 311130561011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 87608896144 + 22556134969 = 295988^2 + 150187^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 110165031113 - 212 = 110165027017 is a prime.

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

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

Almost surely, 2110165031113 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 110165031113 its reverse (311130561011), we get a palindrome (421295592124).

The spelling of 110165031113 in words is "one hundred ten billion, one hundred sixty-five million, thirty-one thousand, one hundred thirteen".