Search a number
-
+
51110011110 = 2351703667037
BaseRepresentation
bin101111100110011001…
…001110000011100110
311212220221111120121110
4233212121032003212
51314133130323420
635251332525450
73456360632514
oct574631160346
9155827446543
1051110011110
111a7482a5904
129aa4780886
134a86a17332
14268bd174b4
1514e2056ee0
hexbe664e0e6

51110011110 has 16 divisors (see below), whose sum is σ = 122664026736. Its totient is φ = 13629336288.

The previous prime is 51110011093. The next prime is 51110011111. The reversal of 51110011110 is 1111001115.

It is a happy number.

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

It is a congruent number.

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

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

Almost surely, 251110011110 is an apocalyptic number.

51110011110 is an abundant number, since it is smaller than the sum of its proper divisors (71554015626).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 1703667047.

The product of its (nonzero) digits is 5, while the sum is 12.

Adding to 51110011110 its reverse (1111001115), we get a palindrome (52221012225).

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

Divisors: 1 2 3 5 6 10 15 30 1703667037 3407334074 5111001111 8518335185 10222002222 17036670370 25555005555 51110011110