Search a number
-
+
115002150055489 is a prime number
BaseRepresentation
bin11010001001100000000110…
…010011010110111001000001
3120002012002122120101001012001
4122021200012103112321001
5110033143400403233424
61044331131451304001
733136426325454244
oct3211400623267101
9502162576331161
10115002150055489
1133709157674214
1210a9422b44b001
134c2286b92acb8
1420581c308325b
15d4670aa87844
hex6898064d6e41

115002150055489 has 2 divisors, whose sum is σ = 115002150055490. Its totient is φ = 115002150055488.

The previous prime is 115002150055483. The next prime is 115002150055517. The reversal of 115002150055489 is 984550051200511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 103576621107600 + 11425528947889 = 10177260^2 + 3380167^2 .

It is a cyclic number.

It is not a de Polignac number, because 115002150055489 - 231 = 115000002571841 is a prime.

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

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

Almost surely, 2115002150055489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 360000, while the sum is 46.

The spelling of 115002150055489 in words is "one hundred fifteen trillion, two billion, one hundred fifty million, fifty-five thousand, four hundred eighty-nine".