Base | Representation |
---|---|
bin | 11101110011010… |
… | …111000100110101 |
3 | 1021211211210100021 |
4 | 131303113010311 |
5 | 2011000100000 |
6 | 121340445141 |
7 | 15250646026 |
oct | 3563270465 |
9 | 1254753307 |
10 | 500003125 |
11 | 237269826 |
12 | 11b5497b1 |
13 | 7c78664b |
14 | 4a596c4d |
15 | 2dd6911a |
hex | 1dcd7135 |
500003125 has 12 divisors (see below), whose sum is σ = 624967812. Its totient is φ = 400000000.
The previous prime is 500003117. The next prime is 500003131. The reversal of 500003125 is 521300005.
It can be written as a sum of positive squares in 6 ways, for example, as 232288081 + 267715044 = 15241^2 + 16362^2 .
It is not a de Polignac number, because 500003125 - 23 = 500003117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 500003099 and 500003108.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 76876 + ... + 83125.
It is an arithmetic number, because the mean of its divisors is an integer number (52080651).
Almost surely, 2500003125 is an apocalyptic number.
It is an amenable number.
500003125 is a deficient number, since it is larger than the sum of its proper divisors (124964687).
500003125 is an frugal number, since it uses more digits than its factorization.
500003125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160026 (or 160006 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 16.
The square root of 500003125 is about 22360.7496520130. The cubic root of 500003125 is about 793.7021795234.
It can be divided in two parts, 50000 and 3125, that multiplied together give a square (156250000 = 125002).
The spelling of 500003125 in words is "five hundred million, three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •