Search a number
-
+
115233161520073 is a prime number
BaseRepresentation
bin11010001100110111001111…
…101010001010001111001001
3120010000011221011012100121211
4122030313033222022033021
5110100440003322120243
61045025214504533121
733162215110510402
oct3214671752121711
9503004834170554
10115233161520073
1133798122612793
1210b10b607811a1
134c3b595a347cc
142065459a629a9
15d4c72b82dd9d
hex68cdcfa8a3c9

115233161520073 has 2 divisors, whose sum is σ = 115233161520074. Its totient is φ = 115233161520072.

The previous prime is 115233161520049. The next prime is 115233161520091. The reversal of 115233161520073 is 370025161332511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 114174952231824 + 1058209288249 = 10685268^2 + 1028693^2 .

It is a cyclic number.

It is not a de Polignac number, because 115233161520073 - 229 = 115232624649161 is a prime.

It is a super-3 number, since 3×1152331615200733 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

Almost surely, 2115233161520073 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 115233161520073 in words is "one hundred fifteen trillion, two hundred thirty-three billion, one hundred sixty-one million, five hundred twenty thousand, seventy-three".