Search a number
-
+
51050006110 = 255105000611
BaseRepresentation
bin101111100010110100…
…010100011001011110
311212202202121000020001
4233202310110121132
51314022300143420
635241350444514
73455031615025
oct574264243136
9155682530201
1051050006110
111a7174411a4
129a8866373a
134a7746800c
142683d778bc
1514dbb52b0a
hexbe2d1465e

51050006110 has 8 divisors (see below), whose sum is σ = 91890011016. Its totient is φ = 20420002440.

The previous prime is 51050006101. The next prime is 51050006143. The reversal of 51050006110 is 1160005015.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 251050006110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5105000618.

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

The spelling of 51050006110 in words is "fifty-one billion, fifty million, six thousand, one hundred ten".

Divisors: 1 2 5 10 5105000611 10210001222 25525003055 51050006110