Search a number
-
+
115343323343561 is a prime number
BaseRepresentation
bin11010001110011101110101…
…110100001010101011001001
3120010101201021112002211002102
4122032131311310022223021
5110104241111233443221
61045151554035043145
733203165035533425
oct3216356564125311
9503351245084072
10115343323343561
113382a913040215
1210b2a3857404b5
134c48aa0910151
14206a90a52bb85
15d50527c3e30b
hex68e775d0aac9

115343323343561 has 2 divisors, whose sum is σ = 115343323343562. Its totient is φ = 115343323343560.

The previous prime is 115343323343471. The next prime is 115343323343587. The reversal of 115343323343561 is 165343323343511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 78208924903561 + 37134398440000 = 8843581^2 + 6093800^2 .

It is a cyclic number.

It is not a de Polignac number, because 115343323343561 - 242 = 110945276832457 is a prime.

It is a super-3 number, since 3×1153433233435613 (a number of 43 digits) contains 333 as substring.

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

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

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

Almost surely, 2115343323343561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3499200, while the sum is 47.

The spelling of 115343323343561 in words is "one hundred fifteen trillion, three hundred forty-three billion, three hundred twenty-three million, three hundred forty-three thousand, five hundred sixty-one".