Search a number
-
+
51615050131 = 246720922193
BaseRepresentation
bin110000000100011111…
…110010100110010011
311221020010211012220101
4300010133302212103
51321201423101011
635413413353231
73505032454501
oct600437624623
9157203735811
1051615050131
111a987394127
12a005938817
134b37544ba8
1426d9021671
1515215682c1
hexc047f2993

51615050131 has 4 divisors (see below), whose sum is σ = 51635974792. Its totient is φ = 51594125472.

The previous prime is 51615050119. The next prime is 51615050171. The reversal of 51615050131 is 13105051615.

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 51615050131 - 213 = 51615041939 is a prime.

It is a super-3 number, since 3×516150501313 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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 51615050131.

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

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

Almost surely, 251615050131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 20924660.

The product of its (nonzero) digits is 2250, while the sum is 28.

The spelling of 51615050131 in words is "fifty-one billion, six hundred fifteen million, fifty thousand, one hundred thirty-one".

Divisors: 1 2467 20922193 51615050131