Search a number
-
+
51011061 = 317003687
BaseRepresentation
bin1100001010010…
…1110111110101
310112222122000120
43002211313311
5101024323221
65021202153
71156405203
oct302456765
9115878016
1051011061
1126881402
1215100359
13a75067a
146abc073
1547295c6
hex30a5df5

51011061 has 4 divisors (see below), whose sum is σ = 68014752. Its totient is φ = 34007372.

The previous prime is 51011057. The next prime is 51011071. The reversal of 51011061 is 16011015.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 51011061 - 22 = 51011057 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8501841 + ... + 8501846.

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

Almost surely, 251011061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17003690.

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

The square root of 51011061 is about 7142.2028114581. The cubic root of 51011061 is about 370.8697847545.

Adding to 51011061 its reverse (16011015), we get a palindrome (67022076).

The spelling of 51011061 in words is "fifty-one million, eleven thousand, sixty-one".

Divisors: 1 3 17003687 51011061