[go: up one dir, main page]

Search a number
-
+
11150065 = 529131587
BaseRepresentation
bin101010100010…
…001011110001
3202222111000101
4222202023301
510323300230
61034552401
7163526323
oct52421361
922874011
1011150065
116326233
123898701
132405194
1416a3613
15ea3aca
hexaa22f1

11150065 has 16 divisors (see below), whose sum is σ = 13970880. Its totient is φ = 8532160.

The previous prime is 11150063. The next prime is 11150071. The reversal of 11150065 is 56005111.

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

It is not a de Polignac number, because 11150065 - 21 = 11150063 is a prime.

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

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

Almost surely, 211150065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 752.

The product of its (nonzero) digits is 150, while the sum is 19.

The square root of 11150065 is about 3339.1713043808. The cubic root of 11150065 is about 223.4047827134.

Adding to 11150065 its reverse (56005111), we get a palindrome (67155176).

It can be divided in two parts, 111 and 50065, that added together give a square (50176 = 2242).

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

Divisors: 1 5 29 131 145 587 655 2935 3799 17023 18995 76897 85115 384485 2230013 11150065