Search a number
-
+
51111530351 = 721134604963
BaseRepresentation
bin101111100110011111…
…000000111101101111
311212221001100202121122
4233212133000331233
51314134022432401
635251425251155
73456406561010
oct574637007557
9155831322548
1051111530351
111a749143282
129aa5193abb
134a871299ab
14268c1d1007
1514e225721b
hexbe67c0f6f

51111530351 has 8 divisors (see below), whose sum is σ = 58690018944. Its totient is φ = 43602252120.

The previous prime is 51111530297. The next prime is 51111530359. The reversal of 51111530351 is 15303511115.

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

It is not a de Polignac number, because 51111530351 - 210 = 51111529327 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17301005 + ... + 17303958.

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

Almost surely, 251111530351 is an apocalyptic number.

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

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

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

The sum of its prime factors is 34605181.

The product of its (nonzero) digits is 1125, while the sum is 26.

The spelling of 51111530351 in words is "fifty-one billion, one hundred eleven million, five hundred thirty thousand, three hundred fifty-one".

Divisors: 1 7 211 1477 34604963 242234741 7301647193 51111530351