Search a number
-
+
51110106011 = 131390153481
BaseRepresentation
bin101111100110011001…
…100101001110011011
311212220221200101210022
4233212121211032123
51314133141343021
635251334541055
73456361506266
oct574631451633
9155827611708
1051110106011
111a748360138
129aa480778b
134a86a4b5a3
14268bd3dcdd
1514e20751ab
hexbe666539b

51110106011 has 4 divisors (see below), whose sum is σ = 51500259624. Its totient is φ = 50719952400.

The previous prime is 51110105987. The next prime is 51110106023. The reversal of 51110106011 is 11060101115.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 51110106011 - 210 = 51110104987 is a prime.

It is a super-2 number, since 2×511101060112 (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 (51110106071) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 195076610 + ... + 195076871.

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

Almost surely, 251110106011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 390153612.

The product of its (nonzero) digits is 30, while the sum is 17.

Adding to 51110106011 its reverse (11060101115), we get a palindrome (62170207126).

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

Divisors: 1 131 390153481 51110106011