Search a number
-
+
115032109 is a prime number
BaseRepresentation
bin1101101101101…
…00000000101101
322000110020101111
412312310000231
5213422011414
615225312021
72564520403
oct666640055
9260406344
10115032109
1159a29365
1232635611
131aaa794a
14113c5473
15a1738c4
hex6db402d

115032109 has 2 divisors, whose sum is σ = 115032110. Its totient is φ = 115032108.

The previous prime is 115032083. The next prime is 115032119. The reversal of 115032109 is 901230511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 112826884 + 2205225 = 10622^2 + 1485^2 .

It is an emirp because it is prime and its reverse (901230511) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 115032109 - 213 = 115023917 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 115032109.

It is a congruent number.

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

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

Almost surely, 2115032109 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 270, while the sum is 22.

The square root of 115032109 is about 10725.3022801225. The cubic root of 115032109 is about 486.3396681074.

The spelling of 115032109 in words is "one hundred fifteen million, thirty-two thousand, one hundred nine".