Search a number
-
+
51011010611 = 11171012700853
BaseRepresentation
bin101111100000011111…
…100100000000110011
311212200001012211110022
4233200133210000303
51313432304314421
635233434554055
73454046302361
oct574037440063
9155601184408
1051011010611
111a6a7427310
129a7759892b
134a6c363762
14267cb06631
1514d84ed7ab
hexbe07e4033

51011010611 has 16 divisors (see below), whose sum is σ = 59505215328. Its totient is φ = 43213632000.

The previous prime is 51011010581. The next prime is 51011010623. The reversal of 51011010611 is 11601011015.

It is not a de Polignac number, because 51011010611 - 226 = 50943901747 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (17).

It is a self number, because there is not a number n which added to its sum of digits gives 51011010611.

It is not an unprimeable number, because it can be changed into a prime (51011010641) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1331540 + ... + 1369313.

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

Almost surely, 251011010611 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2700982.

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

Adding to 51011010611 its reverse (11601011015), we get a palindrome (62612021626).

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

Divisors: 1 11 17 101 187 1111 1717 18887 2700853 29709383 45914501 272786153 505059511 3000647683 4637364601 51011010611