Base | Representation |
---|---|
bin | 1100000011011… |
… | …1100100000000 |
3 | 10112010200020011 |
4 | 3000313210000 |
5 | 100420343412 |
6 | 5003354304 |
7 | 1152514003 |
oct | 300674400 |
9 | 115120204 |
10 | 50559232 |
11 | 265a2999 |
12 | 14b22994 |
13 | a622b09 |
14 | 6a0153a |
15 | 468a7a7 |
hex | 3037900 |
50559232 has 36 divisors (see below), whose sum is σ = 103403916. Its totient is φ = 24657920.
The previous prime is 50559227. The next prime is 50559239. The reversal of 50559232 is 23295505.
It can be written as a sum of positive squares in 2 ways, for example, as 3444736 + 47114496 = 1856^2 + 6864^2 .
It is a junction number, because it is equal to n+sod(n) for n = 50559194 and 50559203.
It is not an unprimeable number, because it can be changed into a prime (50559239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8088 + ... + 12904.
It is an arithmetic number, because the mean of its divisors is an integer number (2872331).
Almost surely, 250559232 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 50559232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51701958).
50559232 is an abundant number, since it is smaller than the sum of its proper divisors (52844684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50559232 is an equidigital number, since it uses as much as digits as its factorization.
50559232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4874 (or 4860 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 31.
The square root of 50559232 is about 7110.5015294281. The cubic root of 50559232 is about 369.7715463351.
The spelling of 50559232 in words is "fifty million, five hundred fifty-nine thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •