Search a number
-
+
515056001009 = 11434411077859
BaseRepresentation
bin1110111111010111011…
…10101101111111110001
31211020110010201210212112
413133223232231333301
531414313314013014
61032340301335105
752132365526124
oct7375356557761
91736403653775
10515056001009
11189485759940
12839a3267495
1339753473804
141ad00a643bb
15d5e780a73e
hex77ebbadff1

515056001009 has 8 divisors (see below), whose sum is σ = 561892729440. Its totient is φ = 468221515200.

The previous prime is 515056001003. The next prime is 515056001027. The reversal of 515056001009 is 900100650515.

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

It is a cyclic number.

It is not a de Polignac number, because 515056001009 - 228 = 514787565553 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

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

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

Almost surely, 2515056001009 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1121311.

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

The spelling of 515056001009 in words is "five hundred fifteen billion, fifty-six million, one thousand, nine".

Divisors: 1 11 43441 477851 1077859 11856449 46823272819 515056001009