Search a number
-
+
51056086851 = 327112294143131
BaseRepresentation
bin101111100011001011…
…100000111101000011
311212210012000221102200
4233203023200331003
51314030324234401
635242125044243
73455134402110
oct574313407503
9155705027380
1051056086851
111a71a914800
129a8a6b6683
134a787b69a3
142684abb907
1514dc454686
hexbe32e0f43

51056086851 has 288 divisors, whose sum is σ = 101223682560. Its totient is φ = 24216192000.

The previous prime is 51056086813. The next prime is 51056086897. The reversal of 51056086851 is 15868065015.

51056086851 is a `hidden beast` number, since 5 + 1 + 0 + 560 + 8 + 6 + 85 + 1 = 666.

It is not a de Polignac number, because 51056086851 - 26 = 51056086787 is a prime.

It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.

It is a junction number, because it is equal to n+sod(n) for n = 51056086797 and 51056086806.

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

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

Almost surely, 251056086851 is an apocalyptic number.

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

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

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

The sum of its prime factors is 279 (or 265 counting only the distinct ones).

The product of its (nonzero) digits is 288000, while the sum is 45.

The spelling of 51056086851 in words is "fifty-one billion, fifty-six million, eighty-six thousand, eight hundred fifty-one".