Search a number
-
+
51000010061 = 71113151337411
BaseRepresentation
bin101111011111110101…
…100110010101001101
311212122021111221112112
4233133311212111031
51313422000310221
635232403113405
73453553634660
oct573765462515
9155567457475
1051000010061
111a6a11a3450
129a73972865
134a69cb1660
14267b4816d7
1514d757915b
hexbdfd6654d

51000010061 has 32 divisors (see below), whose sum is σ = 68929222656. Its totient is φ = 36440280000.

The previous prime is 51000010057. The next prime is 51000010067. The reversal of 51000010061 is 16001000015.

It is a cyclic number.

It is not a de Polignac number, because 51000010061 - 22 = 51000010057 is a prime.

It is a congruent number.

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

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

Almost surely, 251000010061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 337593.

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

Adding to 51000010061 its reverse (16001000015), we get a palindrome (67001010076).

The spelling of 51000010061 in words is "fifty-one billion, ten thousand, sixty-one".

Divisors: 1 7 11 13 77 91 143 151 1001 1057 1661 1963 11627 13741 21593 151151 337411 2361877 3711521 4386343 25980647 30704401 48249773 50949061 337748411 356643427 560439671 662337793 3923077697 4636364551 7285715723 51000010061