Search a number
-
+
115386579457 is a prime number
BaseRepresentation
bin110101101110110010…
…0110111101000000001
3102000211111012120020221
41223131210313220001
53342302431020312
6125001410503041
711223246512512
oct1533544675001
9360744176227
10115386579457
1144a31796a76
121a442894a81
13ab5b47b626
145828754a09
153004e61207
hex1add937a01

115386579457 has 2 divisors, whose sum is σ = 115386579458. Its totient is φ = 115386579456.

The previous prime is 115386579431. The next prime is 115386579493. The reversal of 115386579457 is 754975683511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 107106307441 + 8280272016 = 327271^2 + 90996^2 .

It is a cyclic number.

It is not a de Polignac number, because 115386579457 - 223 = 115378190849 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 115386579395 and 115386579404.

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

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

Almost surely, 2115386579457 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 31752000, while the sum is 61.

The spelling of 115386579457 in words is "one hundred fifteen billion, three hundred eighty-six million, five hundred seventy-nine thousand, four hundred fifty-seven".