Base | Representation |
---|---|
bin | 110011111010010… |
… | …001010010000000 |
3 | 2020200202222020200 |
4 | 303322101102000 |
5 | 3240423210102 |
6 | 222230405200 |
7 | 30403432254 |
oct | 6372212200 |
9 | 2220688220 |
10 | 870913152 |
11 | 407675a3a |
12 | 203800800 |
13 | 10b581235 |
14 | 83948264 |
15 | 516d351c |
hex | 33e91480 |
870913152 has 192 divisors, whose sum is σ = 2625480000. Its totient is φ = 276756480.
The previous prime is 870913151. The next prime is 870913157. The reversal of 870913152 is 251319078.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (870913151) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4376349 + ... + 4376547.
It is an arithmetic number, because the mean of its divisors is an integer number (13674375).
Almost surely, 2870913152 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 870913152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1312740000).
870913152 is an abundant number, since it is smaller than the sum of its proper divisors (1754566848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
870913152 is a wasteful number, since it uses less digits than its factorization.
870913152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 379 (or 364 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The square root of 870913152 is about 29511.2377239586. The cubic root of 870913152 is about 954.9741509592.
The spelling of 870913152 in words is "eight hundred seventy million, nine hundred thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •