Search a number
-
+
51130778961 = 329587710103
BaseRepresentation
bin101111100111101000…
…011100010101010001
311212222101120200202010
4233213220130111101
51314203434411321
635253354013133
73460032310263
oct574750342521
9155871520663
1051130778961
111a758aa0019
129aab7171a9
134a8b1090c2
1426909a1b33
1514e3caa676
hexbe7a1c551

51130778961 has 8 divisors (see below), whose sum is σ = 70525212480. Its totient is φ = 32911765712.

The previous prime is 51130778869. The next prime is 51130779013. The reversal of 51130778961 is 16987703115.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 51130778961 - 27 = 51130778833 is a prime.

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

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

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

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

Almost surely, 251130778961 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 587710135.

The product of its (nonzero) digits is 317520, while the sum is 48.

The spelling of 51130778961 in words is "fifty-one billion, one hundred thirty million, seven hundred seventy-eight thousand, nine hundred sixty-one".

Divisors: 1 3 29 87 587710103 1763130309 17043592987 51130778961