Search a number
-
+
115902729550913 is a prime number
BaseRepresentation
bin11010010110100110110101…
…000001011111110001000001
3120012101012012111120112200212
4122112212311001133301001
5110142422242231112123
61050300551235323505
733261460454043644
oct3226466501376101
9505335174515625
10115902729550913
1133a26087287548
1210bba885750595
134c897714839b6
142089a173d5a5b
15d5ed68dd1878
hex6969b505fc41

115902729550913 has 2 divisors, whose sum is σ = 115902729550914. Its totient is φ = 115902729550912.

The previous prime is 115902729550837. The next prime is 115902729551009. The reversal of 115902729550913 is 319055927209511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 61000661125264 + 54902068425649 = 7810292^2 + 7409593^2 .

It is a cyclic number.

It is not a de Polignac number, because 115902729550913 - 210 = 115902729549889 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2115902729550913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7654500, while the sum is 59.

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