116084964582773 has 2 divisors, whose sum is σ = 116084964582774. Its totient is φ = 116084964582772.

The previous prime is 116084964582757. The next prime is 116084964582781. The reversal of 116084964582773 is 377285469480611.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 82688504995684 + 33396459587089 = 9093322^2 + 5778967^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 116084964582773 - 2⁴ = 116084964582757 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 116084964582697 and 116084964582706.

It is a congruent number.

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅116084964582773 = 232169929165546 is not.

Almost surely, 2^{116084964582773} is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 487710720, while the sum is 71.

The spelling of 116084964582773 in words is "one hundred sixteen trillion, eighty-four billion, nine hundred sixty-four million, five hundred eighty-two thousand, seven hundred seventy-three".