Search a number
-
+
110116913384369 is a prime number
BaseRepresentation
bin11001000010011010010111…
…100000011000101110110001
3112102220002000000201001222002
4121002122113200120232301
5103413123414311244434
61030111002303223345
732123453524060553
oct3102322740305661
9472802000631862
10110116913384369
11320a5358955301
121042548b5a7b55
134959c98b68938
141d299893754d3
15cae5d871557e
hex642697818bb1

110116913384369 has 2 divisors, whose sum is σ = 110116913384370. Its totient is φ = 110116913384368.

The previous prime is 110116913384321. The next prime is 110116913384393. The reversal of 110116913384369 is 963483319611011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 91122526739344 + 18994386645025 = 9545812^2 + 4358255^2 .

It is a cyclic number.

It is not a de Polignac number, because 110116913384369 - 216 = 110116913318833 is a prime.

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

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

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

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

Almost surely, 2110116913384369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2519424, while the sum is 56.

The spelling of 110116913384369 in words is "one hundred ten trillion, one hundred sixteen billion, nine hundred thirteen million, three hundred eighty-four thousand, three hundred sixty-nine".