Search a number
-
+
11390601 = 353711009
BaseRepresentation
bin101011011100…
…111010001001
3210102200222010
4223130322021
510403444401
61044050133
7165550515
oct53347211
923380863
1011390601
11647aa22
123993949
13248a801
141727145
15eeeed6
hexadce89

11390601 has 16 divisors (see below), whose sum is σ = 15707520. Its totient is φ = 7338240.

The previous prime is 11390593. The next prime is 11390641. The reversal of 11390601 is 10609311.

It is a happy number.

It is not a de Polignac number, because 11390601 - 23 = 11390593 is a prime.

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

It is a nialpdrome in base 15.

It is not an unprimeable number, because it can be changed into a prime (11390641) 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 15 ways as a sum of consecutive naturals, for example, 10785 + ... + 11793.

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

Almost surely, 211390601 is an apocalyptic number.

It is an amenable number.

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

11390601 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1136.

The product of its (nonzero) digits is 162, while the sum is 21.

The square root of 11390601 is about 3374.9964444426. The cubic root of 11390601 is about 224.9998419752. Note that the first 3 decimals are identical.

Adding to 11390601 its reverse (10609311), we get a palindrome (21999912).

The spelling of 11390601 in words is "eleven million, three hundred ninety thousand, six hundred one".

Divisors: 1 3 53 71 159 213 1009 3027 3763 11289 53477 71639 160431 214917 3796867 11390601