Search a number
-
+
11689537 is a prime number
BaseRepresentation
bin101100100101…
…111001000001
3210222220000211
4230211321001
510443031122
61054314121
7201234166
oct54457101
923886024
1011689537
116664582
123ab8941
1325638b2
1417a406d
15105d877
hexb25e41

11689537 has 2 divisors, whose sum is σ = 11689538. Its totient is φ = 11689536.

The previous prime is 11689501. The next prime is 11689547. The reversal of 11689537 is 73598611.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5948721 + 5740816 = 2439^2 + 2396^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 11689537 - 27 = 11689409 is a prime.

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 11689537.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 211689537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 45360, while the sum is 40.

The square root of 11689537 is about 3418.9964902000. The cubic root of 11689537 is about 226.9511755628.

The spelling of 11689537 in words is "eleven million, six hundred eighty-nine thousand, five hundred thirty-seven".