Base | Representation |
---|---|
bin | 10010110001101… |
… | …101001011100000 |
3 | 210221202200012102 |
4 | 102301231023200 |
5 | 1121121120000 |
6 | 51131545532 |
7 | 10543424441 |
oct | 2261551340 |
9 | 727680172 |
10 | 315020000 |
11 | 151903209 |
12 | 895bb2a8 |
13 | 50359589 |
14 | 2dba32c8 |
15 | 1c9c93d5 |
hex | 12c6d2e0 |
315020000 has 120 divisors (see below), whose sum is σ = 816769800. Its totient is φ = 119232000.
The previous prime is 315019973. The next prime is 315020003. The reversal of 315020000 is 20513.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (315020003) 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 19 ways as a sum of consecutive naturals, for example, 379586 + ... + 380414.
It is an arithmetic number, because the mean of its divisors is an integer number (6806415).
Almost surely, 2315020000 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 315020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (408384900).
315020000 is an abundant number, since it is smaller than the sum of its proper divisors (501749800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
315020000 is an equidigital number, since it uses as much as digits as its factorization.
315020000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 878 (or 855 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 11.
The square root of 315020000 is about 17748.8027765255. The cubic root of 315020000 is about 680.4236114855.
Adding to 315020000 its reverse (20513), we get a palindrome (315040513).
The spelling of 315020000 in words is "three hundred fifteen million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •