Search a number
-
+
115453391 is a prime number
BaseRepresentation
bin1101110000110…
…10110111001111
322001020122021112
412320122313033
5214024002031
615242322235
72601223544
oct670326717
9261218245
10115453391
115a196929
12327b937b
131abc4621
1411494bcb
15a20862b
hex6e1adcf

115453391 has 2 divisors, whose sum is σ = 115453392. Its totient is φ = 115453390.

The previous prime is 115453363. The next prime is 115453397. The reversal of 115453391 is 193354511.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 115453391 - 218 = 115191247 is a prime.

It is a Sophie Germain prime.

It is equal to p6597041 and since 115453391 and 6597041 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

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

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

Almost surely, 2115453391 is an apocalyptic number.

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

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

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

The product of its digits is 8100, while the sum is 32.

The square root of 115453391 is about 10744.9239643657. The cubic root of 115453391 is about 486.9326519255.

It can be divided in two parts, 1154 and 53391, that added together give a palindrome (54545).

The spelling of 115453391 in words is "one hundred fifteen million, four hundred fifty-three thousand, three hundred ninety-one".