Search a number
-
+
116739500113 is a prime number
BaseRepresentation
bin110110010111000110…
…1110110100001010001
3102011022202222001111101
41230232031312201101
53403040303000423
6125343540344401
711301625243555
oct1545615664121
9364282861441
10116739500113
114556644a315
121a75b9a5101
13b0158551b2
1459162cd865
153083b067ad
hex1b2e376851

116739500113 has 2 divisors, whose sum is σ = 116739500114. Its totient is φ = 116739500112.

The previous prime is 116739500107. The next prime is 116739500159. The reversal of 116739500113 is 311005937611.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 87455049984 + 29284450129 = 295728^2 + 171127^2 .

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

It is a cyclic number.

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

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

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

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

Almost surely, 2116739500113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17010, while the sum is 37.

The spelling of 116739500113 in words is "one hundred sixteen billion, seven hundred thirty-nine million, five hundred thousand, one hundred thirteen".