Search a number
-
+
50315232 = 25311293153
BaseRepresentation
bin1011111111101…
…1111111100000
310111200021112010
42333323333200
5100340041412
64554232520
71150446432
oct277737740
9114607463
1050315232
1126446640
1214a25740
13a568a36
14697a652
15463d33c
hex2ffbfe0

50315232 has 192 divisors, whose sum is σ = 156764160. Its totient is φ = 13977600.

The previous prime is 50315219. The next prime is 50315269. The reversal of 50315232 is 23251305.

It is a junction number, because it is equal to n+sod(n) for n = 50315199 and 50315208.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 949318 + ... + 949370.

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

Almost surely, 250315232 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 50315232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78382080).

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

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

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

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

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

The product of its (nonzero) digits is 900, while the sum is 21.

The square root of 50315232 is about 7093.3230576367. The cubic root of 50315232 is about 369.1757448987.

Adding to 50315232 its reverse (23251305), we get a palindrome (73566537).

The spelling of 50315232 in words is "fifty million, three hundred fifteen thousand, two hundred thirty-two".