Base | Representation |
---|---|
bin | 1010011011110… |
… | …10110101111100 |
3 | 20002201020102000 |
4 | 11031322311330 |
5 | 134402104342 |
6 | 12404102300 |
7 | 2112015000 |
oct | 515726574 |
9 | 202636360 |
10 | 87534972 |
11 | 45458358 |
12 | 25394990 |
13 | 1519ac55 |
14 | b8a8700 |
15 | 7a4144c |
hex | 537ad7c |
87534972 has 192 divisors, whose sum is σ = 282240000. Its totient is φ = 23369472.
The previous prime is 87534929. The next prime is 87534973. The reversal of 87534972 is 27943578.
Its product of digits (423360) is a multiple of the sum of its prime divisors (168).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (87534973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 629679 + ... + 629817.
It is an arithmetic number, because the mean of its divisors is an integer number (1470000).
Almost surely, 287534972 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 87534972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (141120000).
87534972 is an abundant number, since it is smaller than the sum of its proper divisors (194705028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87534972 is a wasteful number, since it uses less digits than its factorization.
87534972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190 (or 168 counting only the distinct ones).
The product of its digits is 423360, while the sum is 45.
The square root of 87534972 is about 9356.0126122189. The cubic root of 87534972 is about 444.0111392384.
The spelling of 87534972 in words is "eighty-seven million, five hundred thirty-four thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •