Base | Representation |
---|---|
bin | 10010110010101… |
… | …001001111101100 |
3 | 210222020011200120 |
4 | 102302221033230 |
5 | 1121202003103 |
6 | 51141124540 |
7 | 10545500640 |
oct | 2262511754 |
9 | 728204616 |
10 | 315266028 |
11 | 151a61040 |
12 | 896b9750 |
13 | 5041455c |
14 | 2dc28c20 |
15 | 1ca27253 |
hex | 12ca93ec |
315266028 has 96 divisors (see below), whose sum is σ = 932843520. Its totient is φ = 80485440.
The previous prime is 315266023. The next prime is 315266051. The reversal of 315266028 is 820662513.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a self number, because there is not a number n which added to its sum of digits gives 315266028.
It is not an unprimeable number, because it can be changed into a prime (315266023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 51625 + ... + 57407.
It is an arithmetic number, because the mean of its divisors is an integer number (9717120).
Almost surely, 2315266028 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 315266028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (466421760).
315266028 is an abundant number, since it is smaller than the sum of its proper divisors (617577492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
315266028 is a wasteful number, since it uses less digits than its factorization.
315266028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5867 (or 5865 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The square root of 315266028 is about 17755.7322574993. The cubic root of 315266028 is about 680.6007004524.
The spelling of 315266028 in words is "three hundred fifteen million, two hundred sixty-six thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •