Search a number
-
+
115556413 = 716508059
BaseRepresentation
bin1101110001101…
…00000000111101
322001102212121011
412320310000331
5214040301123
615244435221
72602133110
oct670640075
9261385534
10115556413
115a257275
1232848b11
131ac2c49b
14114c0577
15a228e0d
hex6e3403d

115556413 has 4 divisors (see below), whose sum is σ = 132064480. Its totient is φ = 99048348.

The previous prime is 115556383. The next prime is 115556417. The reversal of 115556413 is 314655511.

It is a happy number.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 314655511 = 378504203.

It is not a de Polignac number, because 115556413 - 29 = 115555901 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (115556417) 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 in 3 ways as a sum of consecutive naturals, for example, 8254023 + ... + 8254036.

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

Almost surely, 2115556413 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 16508066.

The product of its digits is 9000, while the sum is 31.

The square root of 115556413 is about 10749.7168799927. The cubic root of 115556413 is about 487.0774430010.

The spelling of 115556413 in words is "one hundred fifteen million, five hundred fifty-six thousand, four hundred thirteen".

Divisors: 1 7 16508059 115556413