Search a number
-
+
116292577551389 is a prime number
BaseRepresentation
bin11010011100010001111001…
…110001100110010000011101
3120020202110110200100220102022
4122130101321301212100131
5110220314144323121024
61051200023403105525
733331601324264501
oct3234217161462035
9506673420326368
10116292577551389
1134066450317398
1211062344b122a5
134cb745c785815
1420a083b18a301
15d6a0843e535e
hex69c479c6641d

116292577551389 has 2 divisors, whose sum is σ = 116292577551390. Its totient is φ = 116292577551388.

The previous prime is 116292577551329. The next prime is 116292577551421. The reversal of 116292577551389 is 983155775292611.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 79504507240900 + 36788070310489 = 8916530^2 + 6065317^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-116292577551389 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 2116292577551389 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 285768000, while the sum is 71.

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