Search a number
-
+
2011040515 = 51180945197
BaseRepresentation
bin111011111011110…
…0000101100000011
312012011010102222001
41313313200230003
513104311244030
6531315324431
7100556363611
oct16767405403
95164112861
102011040515
119421a8560
124815b0717
13260841703
141511306b1
15bb843cca
hex77de0b03

2011040515 has 16 divisors (see below), whose sum is σ = 2635947360. Its totient is φ = 1460734720.

The previous prime is 2011040513. The next prime is 2011040531. The reversal of 2011040515 is 5150401102.

It is not a de Polignac number, because 2011040515 - 21 = 2011040513 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 2011040492 and 2011040501.

It is not an unprimeable number, because it can be changed into a prime (2011040513) 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, 21897 + ... + 67093.

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

Almost surely, 22011040515 is an apocalyptic number.

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

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

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

The sum of its prime factors is 46022.

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

The square root of 2011040515 is about 44844.6263781961. The cubic root of 2011040515 is about 1262.2351598182.

Adding to 2011040515 its reverse (5150401102), we get a palindrome (7161441617).

The spelling of 2011040515 in words is "two billion, eleven million, forty thousand, five hundred fifteen".

Divisors: 1 5 11 55 809 4045 8899 44495 45197 225985 497167 2485835 36564373 182821865 402208103 2011040515