Search a number
-
+
51015032 = 2361107977
BaseRepresentation
bin1100001010011…
…0110101111000
310112222211110122
43002212311320
5101024440112
65021232412
71156422605
oct302466570
9115884418
1051015032
1126884392
1215102708
13a752413
146abd6ac
15472a872
hex30a6d78

51015032 has 32 divisors (see below), whose sum is σ = 98230320. Its totient is φ = 24829440.

The previous prime is 51015023. The next prime is 51015047. The reversal of 51015032 is 23051015.

51015032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a super-2 number, since 2×510150322 = 5205066979922048, which contains 22 as substring.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 251015032 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1151 (or 1147 counting only the distinct ones).

The product of its (nonzero) digits is 150, while the sum is 17.

The square root of 51015032 is about 7142.4808015143. The cubic root of 51015032 is about 370.8794080641.

Adding to 51015032 its reverse (23051015), we get a palindrome (74066047).

The spelling of 51015032 in words is "fifty-one million, fifteen thousand, thirty-two".

Divisors: 1 2 4 8 61 107 122 214 244 428 488 856 977 1954 3908 6527 7816 13054 26108 52216 59597 104539 119194 209078 238388 418156 476776 836312 6376879 12753758 25507516 51015032