Search a number
-
+
115585691453 is a prime number
BaseRepresentation
bin110101110100101110…
…0011010111100111101
3102001100100212111120022
41223221130122330331
53343204414111303
6125033242301525
711231215111121
oct1535134327475
9361310774508
10115585691453
1145024122841
121a4994b78a5
13ab907b468b
145846d85581
153017692438
hex1ae971af3d

115585691453 has 2 divisors, whose sum is σ = 115585691454. Its totient is φ = 115585691452.

The previous prime is 115585691401. The next prime is 115585691479. The reversal of 115585691453 is 354196585511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 65804049529 + 49781641924 = 256523^2 + 223118^2 .

It is a cyclic number.

It is not a de Polignac number, because 115585691453 - 28 = 115585691197 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2115585691453 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 115585691453 in words is "one hundred fifteen billion, five hundred eighty-five million, six hundred ninety-one thousand, four hundred fifty-three".