Search a number
-
+
115265569 is a prime number
BaseRepresentation
bin1101101111011…
…01000000100001
322000220002122011
412313231000201
5214001444234
615234312521
72566512136
oct667550041
9260802564
10115265569
115a078801
1232728741
131ab59ca3
141144658d
15a1bcb64
hex6ded021

115265569 has 2 divisors, whose sum is σ = 115265570. Its totient is φ = 115265568.

The previous prime is 115265567. The next prime is 115265587. The reversal of 115265569 is 965562511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 111513600 + 3751969 = 10560^2 + 1937^2 .

It is a cyclic number.

It is not a de Polignac number, because 115265569 - 21 = 115265567 is a prime.

It is a super-2 number, since 2×1152655692 = 26572302793787522, which contains 22 as substring.

Together with 115265567, it forms a pair of twin primes.

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

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

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

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

Almost surely, 2115265569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 81000, while the sum is 40.

The square root of 115265569 is about 10736.1803729259. The cubic root of 115265569 is about 486.6684578550.

The spelling of 115265569 in words is "one hundred fifteen million, two hundred sixty-five thousand, five hundred sixty-nine".