Base | Representation |
---|---|
bin | 10010110010100… |
… | …101100110110000 |
3 | 210222012102020102 |
4 | 102302211212300 |
5 | 1121201013440 |
6 | 51140531532 |
7 | 10545406322 |
oct | 2262454660 |
9 | 728172212 |
10 | 315251120 |
11 | 151a50918 |
12 | 896b0ba8 |
13 | 5040a832 |
14 | 2dc23612 |
15 | 1ca22b15 |
hex | 12ca59b0 |
315251120 has 40 divisors (see below), whose sum is σ = 734015520. Its totient is φ = 125918720.
The previous prime is 315251119. The next prime is 315251161. The reversal of 315251120 is 21152513.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×3152511202 = 198766537322508800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 315251092 and 315251101.
It is an unprimeable number.
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, 62285 + ... + 67155.
It is an arithmetic number, because the mean of its divisors is an integer number (18350388).
Almost surely, 2315251120 is an apocalyptic number.
It is an amenable number.
315251120 is an abundant number, since it is smaller than the sum of its proper divisors (418764400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
315251120 is a wasteful number, since it uses less digits than its factorization.
315251120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5693 (or 5687 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
The square root of 315251120 is about 17755.3124444488. The cubic root of 315251120 is about 680.5899724171.
The spelling of 315251120 in words is "three hundred fifteen million, two hundred fifty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •