Search a number
-
+
115341144565397 is a prime number
BaseRepresentation
bin11010001110011011110011…
…111100110010011010010101
3120010101111122200100102022212
4122032123303330302122111
5110104222131002043042
61045150553524203205
733203060041322462
oct3216336374623225
9503344580312285
10115341144565397
11338299a5195a03
1210b29a77b39505
134c488143cc0ba
14206a781016669
15d5044b815482
hex68e6f3f32695

115341144565397 has 2 divisors, whose sum is σ = 115341144565398. Its totient is φ = 115341144565396.

The previous prime is 115341144565391. The next prime is 115341144565459. The reversal of 115341144565397 is 793565441143511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 85359102522001 + 29982042043396 = 9238999^2 + 5475586^2 .

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

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 2115341144565397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 27216000, while the sum is 59.

The spelling of 115341144565397 in words is "one hundred fifteen trillion, three hundred forty-one billion, one hundred forty-four million, five hundred sixty-five thousand, three hundred ninety-seven".