Search a number
-
+
51060500009 = 411675974311
BaseRepresentation
bin101111100011011100…
…010110011000101001
311212210111100011010222
4233203130112120221
51314032442000014
635242403415425
73455220042341
oct574334263051
9155714304128
1051060500009
111a722359442
129a90084575
134a796a061c
142685509d21
1514dca2708e
hexbe3716629

51060500009 has 8 divisors (see below), whose sum is σ = 52309703040. Its totient is φ = 49811479200.

The previous prime is 51060499967. The next prime is 51060500021. The reversal of 51060500009 is 90000506015.

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 51060500009 - 220 = 51059451433 is a prime.

It is a super-2 number, since 2×510605000092 (a number of 22 digits) contains 22 as substring.

It is a Duffinian number.

It is a Curzon number.

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

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

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

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

Almost surely, 251060500009 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 91111.

The product of its (nonzero) digits is 1350, while the sum is 26.

The spelling of 51060500009 in words is "fifty-one billion, sixty million, five hundred thousand, nine".

Divisors: 1 41 16759 74311 687119 3046751 1245378049 51060500009