Search a number
-
+
115304089261 is a prime number
BaseRepresentation
bin110101101100010101…
…0001100011010101101
3102000121201222121222111
41223120222030122231
53342120321324021
6124545302444021
711221225405354
oct1533052143255
9360551877874
10115304089261
114499a174959
121a41b133611
13ab4735896a
14581b80099b
152eecab98e1
hex1ad8a8c6ad

115304089261 has 2 divisors, whose sum is σ = 115304089262. Its totient is φ = 115304089260.

The previous prime is 115304089193. The next prime is 115304089273. The reversal of 115304089261 is 162980403511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 113980512100 + 1323577161 = 337610^2 + 36381^2 .

It is a cyclic number.

It is not a de Polignac number, because 115304089261 - 27 = 115304089133 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2115304089261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 51840, while the sum is 40.

The spelling of 115304089261 in words is "one hundred fifteen billion, three hundred four million, eighty-nine thousand, two hundred sixty-one".