Base | Representation |
---|---|
bin | 10010110001101… |
… | …110010000100101 |
3 | 210221202220021011 |
4 | 102301232100211 |
5 | 1121121240141 |
6 | 51132022221 |
7 | 10543443355 |
oct | 2261562045 |
9 | 727686234 |
10 | 315024421 |
11 | 151906568 |
12 | 89601971 |
13 | 5035b5aa |
14 | 2dba4b65 |
15 | 1c9ca881 |
hex | 12c6e425 |
315024421 has 8 divisors (see below), whose sum is σ = 321835680. Its totient is φ = 308245392.
The previous prime is 315024403. The next prime is 315024431. The reversal of 315024421 is 124420513.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-315024421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 315024392 and 315024401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (315024431) 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 7 ways as a sum of consecutive naturals, for example, 12246 + ... + 27928.
It is an arithmetic number, because the mean of its divisors is an integer number (40229460).
Almost surely, 2315024421 is an apocalyptic number.
It is an amenable number.
315024421 is a deficient number, since it is larger than the sum of its proper divisors (6811259).
315024421 is a wasteful number, since it uses less digits than its factorization.
315024421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16115.
The product of its (nonzero) digits is 960, while the sum is 22.
The square root of 315024421 is about 17748.9273197002. The cubic root of 315024421 is about 680.4267944990.
Adding to 315024421 its reverse (124420513), we get a palindrome (439444934).
The spelling of 315024421 in words is "three hundred fifteen million, twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •