Base | Representation |
---|---|
bin | 1010011000010… |
… | …01011000011100 |
3 | 20001211121220120 |
4 | 11030021120130 |
5 | 134242221421 |
6 | 12350114540 |
7 | 2105041041 |
oct | 514113034 |
9 | 201747816 |
10 | 87070236 |
11 | 45170180 |
12 | 251aba50 |
13 | 15067566 |
14 | b7c71c8 |
15 | 799d8c6 |
hex | 530961c |
87070236 has 96 divisors (see below), whose sum is σ = 235872000. Its totient is φ = 24721920.
The previous prime is 87070223. The next prime is 87070271. The reversal of 87070236 is 63207078.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 87070197 and 87070206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 373576 + ... + 373808.
It is an arithmetic number, because the mean of its divisors is an integer number (2457000).
Almost surely, 287070236 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 87070236, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117936000).
87070236 is an abundant number, since it is smaller than the sum of its proper divisors (148801764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87070236 is a wasteful number, since it uses less digits than its factorization.
87070236 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419 (or 417 counting only the distinct ones).
The product of its (nonzero) digits is 14112, while the sum is 33.
The square root of 87070236 is about 9331.1433383053. The cubic root of 87070236 is about 443.2239711150.
The spelling of 87070236 in words is "eighty-seven million, seventy thousand, two hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •