Base | Representation |
---|---|
bin | 1100000100101… |
… | …1110011001101 |
3 | 10112021212221021 |
4 | 3001023303031 |
5 | 100431022000 |
6 | 5005234141 |
7 | 1153310452 |
oct | 301136315 |
9 | 115255837 |
10 | 50642125 |
11 | 2664a1a6 |
12 | 14b62951 |
13 | a651771 |
14 | 6a23829 |
15 | 46a511a |
hex | 304bccd |
50642125 has 16 divisors (see below), whose sum is σ = 66530880. Its totient is φ = 38379600.
The previous prime is 50642047. The next prime is 50642129. The reversal of 50642125 is 52124605.
50642125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50642125 - 211 = 50640077 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 50642125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50642129) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 8287 + ... + 13036.
It is an arithmetic number, because the mean of its divisors is an integer number (4158180).
Almost surely, 250642125 is an apocalyptic number.
It is an amenable number.
50642125 is a deficient number, since it is larger than the sum of its proper divisors (15888755).
50642125 is a wasteful number, since it uses less digits than its factorization.
50642125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21357 (or 21347 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 50642125 is about 7116.3280559569. The cubic root of 50642125 is about 369.9735189229.
The spelling of 50642125 in words is "fifty million, six hundred forty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •