Search a number
-
+
115902729550169 is a prime number
BaseRepresentation
bin11010010110100110110101…
…000001011111100101011001
3120012101012012111120111200022
4122112212311001133211121
5110142422242231101134
61050300551235320225
733261460454041532
oct3226466501374531
9505335174514608
10115902729550169
1133a26087286a31
1210bba885750075
134c89771483563
142089a173d5689
15d5ed68dd152e
hex6969b505f959

115902729550169 has 2 divisors, whose sum is σ = 115902729550170. Its totient is φ = 115902729550168.

The previous prime is 115902729550163. The next prime is 115902729550193. The reversal of 115902729550169 is 961055927209511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 79032331140169 + 36870398410000 = 8890013^2 + 6072100^2 .

It is a cyclic number.

It is not a de Polignac number, because 115902729550169 - 28 = 115902729549913 is a prime.

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

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

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

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

Almost surely, 2115902729550169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15309000, while the sum is 62.

The spelling of 115902729550169 in words is "one hundred fifteen trillion, nine hundred two billion, seven hundred twenty-nine million, five hundred fifty thousand, one hundred sixty-nine".