Search a number
-
+
11690127 = 322714793
BaseRepresentation
bin101100100110…
…000010001111
3210222220211200
4230212002033
510443041002
61054320543
7201236001
oct54460217
923886750
1011690127
116664a69
123ab9153
132563c47
1417a4371
15105db1c
hexb2608f

11690127 has 12 divisors (see below), whose sum is σ = 16951584. Its totient is φ = 7763040.

The previous prime is 11690123. The next prime is 11690137. The reversal of 11690127 is 72109611.

It is not a de Polignac number, because 11690127 - 22 = 11690123 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 211690127 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5070 (or 5067 counting only the distinct ones).

The product of its (nonzero) digits is 756, while the sum is 27.

The square root of 11690127 is about 3419.0827717386. The cubic root of 11690127 is about 226.9549937620.

Adding to 11690127 its reverse (72109611), we get a palindrome (83799738).

The spelling of 11690127 in words is "eleven million, six hundred ninety thousand, one hundred twenty-seven".

Divisors: 1 3 9 271 813 2439 4793 14379 43137 1298903 3896709 11690127