Base | Representation |
---|---|
bin | 1100000001111… |
… | …1100111000101 |
3 | 10111221200122120 |
4 | 3000133213011 |
5 | 100404224000 |
6 | 5001320153 |
7 | 1151624661 |
oct | 300374705 |
9 | 114850576 |
10 | 50461125 |
11 | 26536210 |
12 | 14a96059 |
13 | a5ba270 |
14 | 69b78a1 |
15 | 466b6a0 |
hex | 301f9c5 |
50461125 has 64 divisors (see below), whose sum is σ = 98751744. Its totient is φ = 22560000.
The previous prime is 50461121. The next prime is 50461133. The reversal of 50461125 is 52116405.
50461125 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 50461125 - 22 = 50461121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50461095 and 50461104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50461121) 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 63 ways as a sum of consecutive naturals, for example, 53155 + ... + 54095.
It is an arithmetic number, because the mean of its divisors is an integer number (1542996).
Almost surely, 250461125 is an apocalyptic number.
50461125 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50461125 is a deficient number, since it is larger than the sum of its proper divisors (48290619).
50461125 is a wasteful number, since it uses less digits than its factorization.
50461125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 983 (or 973 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 50461125 is about 7103.5994397207. The cubic root of 50461125 is about 369.5322186824.
The spelling of 50461125 in words is "fifty million, four hundred sixty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •