Base | Representation |
---|---|
bin | 1011111101000… |
… | …1100101011100 |
3 | 10111100110020210 |
4 | 2333101211130 |
5 | 100314012112 |
6 | 4550412420 |
7 | 1146124140 |
oct | 277214534 |
9 | 114313223 |
10 | 50141532 |
11 | 26338091 |
12 | 14961110 |
13 | a50795c |
14 | 6933220 |
15 | 4606b3c |
hex | 2fd195c |
50141532 has 96 divisors (see below), whose sum is σ = 142732800. Its totient is φ = 13381632.
The previous prime is 50141519. The next prime is 50141557. The reversal of 50141532 is 23514105.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 50141499 and 50141508.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 141868 + ... + 142220.
It is an arithmetic number, because the mean of its divisors is an integer number (1486800).
Almost surely, 250141532 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 50141532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71366400).
50141532 is an abundant number, since it is smaller than the sum of its proper divisors (92591268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50141532 is a wasteful number, since it uses less digits than its factorization.
50141532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475 (or 473 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 50141532 is about 7081.0685634302. The cubic root of 50141532 is about 368.7504279608.
Adding to 50141532 its reverse (23514105), we get a palindrome (73655637).
The spelling of 50141532 in words is "fifty million, one hundred forty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •