Search a number
-
+
11000505665 = 523431221941
BaseRepresentation
bin10100011111010111…
…00110010101000001
31001101122101120212202
422033223212111001
5140012112140130
65015323002545
7536413520042
oct121753462501
931348346782
1011000505665
1147355537a6
122170069455
131064073866
14764da28c9
15445b3e145
hex28fae6541

11000505665 has 16 divisors (see below), whose sum is σ = 13806567936. Its totient is φ = 8398209600.

The previous prime is 11000505661. The next prime is 11000505721. The reversal of 11000505665 is 56650500011.

11000505665 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 11000505665 - 22 = 11000505661 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 211000505665 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 222400.

The product of its (nonzero) digits is 4500, while the sum is 29.

The spelling of 11000505665 in words is "eleven billion, five hundred five thousand, six hundred sixty-five".

Divisors: 1 5 23 115 431 2155 9913 49565 221941 1109705 5104643 25523215 95656571 478282855 2200101133 11000505665