Search a number
-
+
115152332101049 is a prime number
BaseRepresentation
bin11010001011101011111101…
…110110011001010110111001
3120002201110022000101102121202
4122023223331312121112321
5110043123434004213144
61044524130121543545
733153324065003465
oct3213537566312671
9502643260342552
10115152332101049
1133766914501941
1210ab9363044bb5
134c33a83b19409
14206158caa14a5
15d4a59a62664e
hex68bafdd995b9

115152332101049 has 2 divisors, whose sum is σ = 115152332101050. Its totient is φ = 115152332101048.

The previous prime is 115152332101013. The next prime is 115152332101063. The reversal of 115152332101049 is 940101233251511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 91173241147024 + 23979090954025 = 9548468^2 + 4896845^2 .

It is a cyclic number.

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

It is a super-3 number, since 3×1151523321010493 (a number of 43 digits) contains 333 as substring.

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

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

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

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

Almost surely, 2115152332101049 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 32400, while the sum is 38.

The spelling of 115152332101049 in words is "one hundred fifteen trillion, one hundred fifty-two billion, three hundred thirty-two million, one hundred one thousand, forty-nine".