Search a number
-
+
11549051 is a prime number
BaseRepresentation
bin101100000011…
…100101111011
3210201202022122
4230003211323
510424032201
61051311455
7200110463
oct54034573
923652278
1011549051
116578a78
123a4b58b
132514977
141768ba3
151031e1b
hexb0397b

11549051 has 2 divisors, whose sum is σ = 11549052. Its totient is φ = 11549050.

The previous prime is 11549023. The next prime is 11549053. The reversal of 11549051 is 15094511.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11549051 - 26 = 11548987 is a prime.

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

It is a Chen prime.

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

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

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

Almost surely, 211549051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 900, while the sum is 26.

The square root of 11549051 is about 3398.3894714997. The cubic root of 11549051 is about 226.0383350535.

The spelling of 11549051 in words is "eleven million, five hundred forty-nine thousand, fifty-one".