Base | Representation |
---|---|
bin | 1100000011000… |
… | …0000011001000 |
3 | 10112002010000022 |
4 | 3000300003020 |
5 | 100413402311 |
6 | 5003000012 |
7 | 1152325166 |
oct | 300600310 |
9 | 115063008 |
10 | 50528456 |
11 | 26581860 |
12 | 14b09008 |
13 | a611ac4 |
14 | 69d4236 |
15 | 46815db |
hex | 30300c8 |
50528456 has 32 divisors (see below), whose sum is σ = 103982400. Its totient is φ = 22827840.
The previous prime is 50528453. The next prime is 50528473. The reversal of 50528456 is 65482505.
It is a Smith number, since the sum of its digits (35) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (50528453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13565 + ... + 16883.
It is an arithmetic number, because the mean of its divisors is an integer number (3249450).
Almost surely, 250528456 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 50528456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51991200).
50528456 is an abundant number, since it is smaller than the sum of its proper divisors (53453944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50528456 is a wasteful number, since it uses less digits than its factorization.
50528456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3509 (or 3505 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 35.
The square root of 50528456 is about 7108.3370769822. The cubic root of 50528456 is about 369.6965030080.
The spelling of 50528456 in words is "fifty million, five hundred twenty-eight thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •