Search a number
-
+
2009555015 = 51330916231
BaseRepresentation
bin111011111000111…
…0110000001000111
312012001022222020112
41313301312001013
513103421230030
6531223423235
7100540635656
oct16761660107
95161288215
102009555015
11941383476
12480bb4b1b
13260441510
14150c6519d
15bb64da95
hex77c76047

2009555015 has 8 divisors (see below), whose sum is σ = 2596963488. Its totient is φ = 1483979040.

The previous prime is 2009554997. The next prime is 2009555027. The reversal of 2009555015 is 5105559002.

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

It is not a de Polignac number, because 2009555015 - 210 = 2009553991 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 15458051 + ... + 15458180.

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

Almost surely, 22009555015 is an apocalyptic number.

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

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

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

The sum of its prime factors is 30916249.

The product of its (nonzero) digits is 11250, while the sum is 32.

The square root of 2009555015 is about 44828.0605759384. The cubic root of 2009555015 is about 1261.9242905297.

The spelling of 2009555015 in words is "two billion, nine million, five hundred fifty-five thousand, fifteen".

Divisors: 1 5 13 65 30916231 154581155 401911003 2009555015