Base | Representation |
---|---|
bin | 11101110100111… |
… | …000001111100101 |
3 | 1021212121000022000 |
4 | 131310320033211 |
5 | 2011100314000 |
6 | 121353155513 |
7 | 15254224260 |
oct | 3564701745 |
9 | 1255530260 |
10 | 500401125 |
11 | 237510854 |
12 | 11b6bbb99 |
13 | 7c895853 |
14 | 4a65bcd7 |
15 | 2dde7000 |
hex | 1dd383e5 |
500401125 has 128 divisors (see below), whose sum is σ = 1078272000. Its totient is φ = 224251200.
The previous prime is 500401093. The next prime is 500401127. The reversal of 500401125 is 521104005.
500401125 is a `hidden beast` number, since 500 + 40 + 1 + 125 = 666.
It is not a de Polignac number, because 500401125 - 25 = 500401093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 500401098 and 500401107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (500401127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1393696 + ... + 1394054.
It is an arithmetic number, because the mean of its divisors is an integer number (8424000).
Almost surely, 2500401125 is an apocalyptic number.
It is an amenable number.
500401125 is an abundant number, since it is smaller than the sum of its proper divisors (577870875).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
500401125 is a wasteful number, since it uses less digits than its factorization.
500401125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 449 (or 433 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 18.
The square root of 500401125 is about 22369.6474044630. The cubic root of 500401125 is about 793.9127179995.
The spelling of 500401125 in words is "five hundred million, four hundred one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •