Search a number
-
+
115929433 is a prime number
BaseRepresentation
bin1101110100011…
…11000101011001
322002010211021201
412322033011121
5214134220213
615300434201
72605245454
oct672170531
9262124251
10115929433
115a491554
12329a8961
131b0301c9
141157a49b
15a29e6dd
hex6e8f159

115929433 has 2 divisors, whose sum is σ = 115929434. Its totient is φ = 115929432.

The previous prime is 115929421. The next prime is 115929461. The reversal of 115929433 is 334929511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 66536649 + 49392784 = 8157^2 + 7028^2 .

It is a cyclic number.

It is not a de Polignac number, because 115929433 - 225 = 82375001 is a prime.

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

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

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

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

Almost surely, 2115929433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 29160, while the sum is 37.

The square root of 115929433 is about 10767.0531251592. The cubic root of 115929433 is about 487.6009808784.

It can be divided in two parts, 11592 and 9433, that added together give a square (21025 = 1452).

The spelling of 115929433 in words is "one hundred fifteen million, nine hundred twenty-nine thousand, four hundred thirty-three".