Base | Representation |
---|---|
bin | 1011111110101… |
… | …0011100000000 |
3 | 10111112121220000 |
4 | 2333222130000 |
5 | 100330241303 |
6 | 4552520000 |
7 | 1150030002 |
oct | 277523400 |
9 | 114477800 |
10 | 50243328 |
11 | 263a7613 |
12 | 149b0000 |
13 | a5420a5 |
14 | 695c372 |
15 | 4626da3 |
hex | 2fea700 |
50243328 has 90 divisors (see below), whose sum is σ = 149878344. Its totient is φ = 16740864.
The previous prime is 50243309. The next prime is 50243351. The reversal of 50243328 is 82334205.
50243328 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 19525 + ... + 21947.
Almost surely, 250243328 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 50243328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74939172).
50243328 is an abundant number, since it is smaller than the sum of its proper divisors (99635016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50243328 is an equidigital number, since it uses as much as digits as its factorization.
50243328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2451 (or 2428 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 50243328 is about 7088.2528171616. The cubic root of 50243328 is about 368.9998017052. Note that the first 3 decimals are identical.
The spelling of 50243328 in words is "fifty million, two hundred forty-three thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •