Search a number
-
+
115127161 is a prime number
BaseRepresentation
bin1101101110010…
…11001101111001
322000122001202221
412313023031321
5213433032121
615231324041
72565364462
oct667131571
9260561687
10115127161
1159a93816
1232680621
131ab0bca6
141140bd69
15a191b41
hex6dcb379

115127161 has 2 divisors, whose sum is σ = 115127162. Its totient is φ = 115127160.

The previous prime is 115127153. The next prime is 115127203. The reversal of 115127161 is 161721511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 113827561 + 1299600 = 10669^2 + 1140^2 .

It is a cyclic number.

It is not a de Polignac number, because 115127161 - 23 = 115127153 is a prime.

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

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

Almost surely, 2115127161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 420, while the sum is 25.

The square root of 115127161 is about 10729.7325688947. The cubic root of 115127161 is about 486.4735867487.

Adding to 115127161 its reverse (161721511), we get a palindrome (276848672).

The spelling of 115127161 in words is "one hundred fifteen million, one hundred twenty-seven thousand, one hundred sixty-one".