Search a number
-
+
115172558549 is a prime number
BaseRepresentation
bin110101101000011010…
…0011100011011010101
3102000021120111011202122
41223100310130123111
53341333133333144
6124524243345325
711215040411036
oct1532064343325
9360246434678
10115172558549
11449319a7994
121a3a3082245
13ab26025539
145808162a8d
152ee12877ee
hex1ad0d1c6d5

115172558549 has 2 divisors, whose sum is σ = 115172558550. Its totient is φ = 115172558548.

The previous prime is 115172558483. The next prime is 115172558593. The reversal of 115172558549 is 945855271511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102467211025 + 12705347524 = 320105^2 + 112718^2 .

It is a cyclic number.

It is not a de Polignac number, because 115172558549 - 228 = 114904123093 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 115172558549.

It is a congruent number.

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

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

Almost surely, 2115172558549 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2520000, while the sum is 53.

The spelling of 115172558549 in words is "one hundred fifteen billion, one hundred seventy-two million, five hundred fifty-eight thousand, five hundred forty-nine".