Base | Representation |
---|---|
bin | 1010011100001… |
… | …10000000000000 |
3 | 20002210120002121 |
4 | 11032012000000 |
5 | 134410040142 |
6 | 12405054024 |
7 | 2112265144 |
oct | 516060000 |
9 | 202716077 |
10 | 87580672 |
11 | 45489723 |
12 | 253b7314 |
13 | 151b59aa |
14 | b8bb224 |
15 | 7a4ec67 |
hex | 5386000 |
87580672 has 28 divisors (see below), whose sum is σ = 175167036. Its totient is φ = 43786240.
The previous prime is 87580663. The next prime is 87580679. The reversal of 87580672 is 27608578.
It is a happy number.
It is a Smith number, since the sum of its digits (43) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (87580679) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2847 + ... + 13537.
Almost surely, 287580672 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 87580672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87583518).
87580672 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87580672 is an equidigital number, since it uses as much as digits as its factorization.
87580672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10717 (or 10693 counting only the distinct ones).
The product of its (nonzero) digits is 188160, while the sum is 43.
The square root of 87580672 is about 9358.4545732722. The cubic root of 87580672 is about 444.0883951375.
The spelling of 87580672 in words is "eighty-seven million, five hundred eighty thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •