Search a number
-
+
51111012110 = 257171987341
BaseRepresentation
bin101111100110011101…
…000010011100001110
311212221000101102201112
4233212131002130032
51314133404341420
635251410212022
73456402302054
oct574635023416
9155830342645
1051111012110
111a748919984
129aa4b84012
134a86ca7b42
14268c0d81d4
1514e21a38c5
hexbe674270e

51111012110 has 16 divisors (see below), whose sum is σ = 93295595232. Its totient is φ = 20156455200.

The previous prime is 51111012079. The next prime is 51111012133. The reversal of 51111012110 is 1121011115.

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

It is a Curzon number.

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

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

Almost surely, 251111012110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 71987419.

The product of its (nonzero) digits is 10, while the sum is 14.

Adding to 51111012110 its reverse (1121011115), we get a palindrome (52232023225).

The spelling of 51111012110 in words is "fifty-one billion, one hundred eleven million, twelve thousand, one hundred ten".

Divisors: 1 2 5 10 71 142 355 710 71987341 143974682 359936705 719873410 5111101211 10222202422 25555506055 51111012110