Base | Representation |
---|---|
bin | 10010110011010… |
… | …111011010100100 |
3 | 210222120210002201 |
4 | 102303113122210 |
5 | 1121224031030 |
6 | 51145144244 |
7 | 10550216200 |
oct | 2263273244 |
9 | 728523081 |
10 | 315455140 |
11 | 152080130 |
12 | 8978b084 |
13 | 5047c660 |
14 | 2dc77b00 |
15 | 1ca632ca |
hex | 12cd76a4 |
315455140 has 144 divisors (see below), whose sum is σ = 905736384. Its totient is φ = 90720000.
The previous prime is 315455089. The next prime is 315455141. The reversal of 315455140 is 41554513.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 315455099 and 315455108.
It is not an unprimeable number, because it can be changed into a prime (315455141) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 139015 + ... + 141265.
It is an arithmetic number, because the mean of its divisors is an integer number (6289836).
Almost surely, 2315455140 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 315455140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (452868192).
315455140 is an abundant number, since it is smaller than the sum of its proper divisors (590281244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
315455140 is a wasteful number, since it uses less digits than its factorization.
315455140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2298 (or 2289 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 315455140 is about 17761.0568379249. The cubic root of 315455140 is about 680.7367591259.
The spelling of 315455140 in words is "three hundred fifteen million, four hundred fifty-five thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •