Search a number
-
+
11005161 = 319193073
BaseRepresentation
bin101001111110…
…110011101001
3202201010020120
4221332303221
510304131121
61031513453
7162354006
oct51766351
922633216
1011005161
116237382
123828889
13238423b
1416668ad
15e75bc6
hexa7ece9

11005161 has 8 divisors (see below), whose sum is σ = 15445920. Its totient is φ = 6950592.

The previous prime is 11005157. The next prime is 11005177. The reversal of 11005161 is 16150011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 11005161 - 22 = 11005157 is a prime.

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

It is a plaindrome in base 14.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96480 + ... + 96593.

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

Almost surely, 211005161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 193095.

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

The square root of 11005161 is about 3317.4027491398. The cubic root of 11005161 is about 222.4327853195.

Adding to 11005161 its reverse (16150011), we get a palindrome (27155172).

The spelling of 11005161 in words is "eleven million, five thousand, one hundred sixty-one".

Divisors: 1 3 19 57 193073 579219 3668387 11005161