Search a number
-
+
115160665589 is a prime number
BaseRepresentation
bin110101101000000011…
…1000100110111110101
3102000020202002221200122
41223100013010313311
53341322112244324
6124523140421325
711214534335504
oct1532007046765
9360222087618
10115160665589
11449262145a2
121a39b0a7845
13ab23720198
14580674883b
152ee01d8a5e
hex1ad01c4df5

115160665589 has 2 divisors, whose sum is σ = 115160665590. Its totient is φ = 115160665588.

The previous prime is 115160665541. The next prime is 115160665661. The reversal of 115160665589 is 985566061511.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 69121668100 + 46038997489 = 262910^2 + 214567^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 115160665589 - 236 = 46441188853 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 115160665589.

It is a congruent number.

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

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

Almost surely, 2115160665589 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1944000, while the sum is 53.

The spelling of 115160665589 in words is "one hundred fifteen billion, one hundred sixty million, six hundred sixty-five thousand, five hundred eighty-nine".