Search a number
-
+
115500510366229 is a prime number
BaseRepresentation
bin11010010000110000001110…
…111001000100101000010101
3120010221202000011012220121201
4122100300032321010220111
5110114330021123204404
61045352111342312501
733220431214301512
oct3220601671045025
9503852004186551
10115500510366229
113389054501191a
1210b54933288731
134c5a861157a31
14207437c600309
15d5467777bca4
hex690c0ee44a15

115500510366229 has 2 divisors, whose sum is σ = 115500510366230. Its totient is φ = 115500510366228.

The previous prime is 115500510366191. The next prime is 115500510366253. The reversal of 115500510366229 is 922663015005511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102547723762225 + 12952786604004 = 10126585^2 + 3598998^2 .

It is a cyclic number.

It is not a de Polignac number, because 115500510366229 - 29 = 115500510365717 is a prime.

It is a congruent number.

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

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

Almost surely, 2115500510366229 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 115500510366229 in words is "one hundred fifteen trillion, five hundred billion, five hundred ten million, three hundred sixty-six thousand, two hundred twenty-nine".