Search a number
-
+
11663023161 = 361521122327
BaseRepresentation
bin10101101110010101…
…11001110000111001
31010002211000222000210
422313022321300321
5142341213220121
65205151021333
7562010026656
oct126712716071
933084028023
1011663023161
114a45521a19
122315b0a849
13113b3bb24a
147c8d80c2d
15483daa876
hex2b72b9c39

11663023161 has 16 divisors (see below), whose sum is σ = 15836093568. Its totient is φ = 7633142400.

The previous prime is 11663023159. The next prime is 11663023199. The reversal of 11663023161 is 16132036611.

It is not a de Polignac number, because 11663023161 - 21 = 11663023159 is a prime.

It is a super-2 number, since 2×116630231612 (a number of 21 digits) contains 22 as substring.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (11663023121) by changing a digit.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34180 + ... + 156506.

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

Almost surely, 211663023161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 122912.

The product of its (nonzero) digits is 3888, while the sum is 30.

Adding to 11663023161 its reverse (16132036611), we get a palindrome (27795059772).

The spelling of 11663023161 in words is "eleven billion, six hundred sixty-three million, twenty-three thousand, one hundred sixty-one".

Divisors: 1 3 61 183 521 1563 31781 95343 122327 366981 7461947 22385841 63732367 191197101 3887674387 11663023161