Search a number
-
+
51111015051 = 3314312780949
BaseRepresentation
bin101111100110011101…
…000011001010001011
311212221000101120202110
4233212131003022023
51314133404440201
635251410233403
73456402313455
oct574635031213
9155830346673
1051111015051
111a748921108
129aa4b85863
134a86ca9295
14268c0d92d5
1514e21a46d6
hexbe674328b

51111015051 has 16 divisors (see below), whose sum is σ = 71982310400. Its totient is φ = 32207988960.

The previous prime is 51111015023. The next prime is 51111015061. The reversal of 51111015051 is 15051011115.

It is not a de Polignac number, because 51111015051 - 25 = 51111015019 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (51111015061) 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 15 ways as a sum of consecutive naturals, for example, 6386476 + ... + 6394473.

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

Almost surely, 251111015051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 12781026.

The product of its (nonzero) digits is 125, while the sum is 21.

Adding to 51111015051 its reverse (15051011115), we get a palindrome (66162026166).

The spelling of 51111015051 in words is "fifty-one billion, one hundred eleven million, fifteen thousand, fifty-one".

Divisors: 1 3 31 43 93 129 1333 3999 12780949 38342847 396209419 549580807 1188628257 1648742421 17037005017 51111015051