Search a number
-
+
51010152 = 2336134843
BaseRepresentation
bin1100001010010…
…1101001101000
310112222120202220
43002211221220
5101024311102
65021154040
71156402434
oct302455150
9115876686
1051010152
1126880756
12150bb920
13a75012b
146abb9c4
1547291bc
hex30a5a68

51010152 has 32 divisors (see below), whose sum is σ = 129619680. Its totient is φ = 16724160.

The previous prime is 51010129. The next prime is 51010171. The reversal of 51010152 is 25101015.

It is an unprimeable number.

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

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

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

Almost surely, 251010152 is an apocalyptic number.

It is an amenable number.

51010152 is an abundant number, since it is smaller than the sum of its proper divisors (78609528).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

The square root of 51010152 is about 7142.1391753452. The cubic root of 51010152 is about 370.8675818163.

Adding to 51010152 its reverse (25101015), we get a palindrome (76111167).

The spelling of 51010152 in words is "fifty-one million, ten thousand, one hundred fifty-two".

Divisors: 1 2 3 4 6 8 12 24 61 122 183 244 366 488 732 1464 34843 69686 104529 139372 209058 278744 418116 836232 2125423 4250846 6376269 8501692 12752538 17003384 25505076 51010152