Search a number
-
+
51014212709 = 612003417523
BaseRepresentation
bin101111100000101011…
…110001110001100101
311212200021020111220112
4233200223301301211
51313434114301314
635234031342405
73454115440055
oct574053616145
9155607214815
1051014212709
111a6a9214079
129a78681a05
134a6cc150a5
14267d2db565
1514d893243e
hexbe0af1c65

51014212709 has 8 divisors (see below), whose sum is σ = 51876521952. Its totient is φ = 50152742640.

The previous prime is 51014212657. The next prime is 51014212723. The reversal of 51014212709 is 90721241015.

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 51014212709 - 28 = 51014212453 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 251014212709 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 419587.

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

The spelling of 51014212709 in words is "fifty-one billion, fourteen million, two hundred twelve thousand, seven hundred nine".

Divisors: 1 61 2003 122183 417523 25468903 836298569 51014212709