Base | Representation |
---|---|
bin | 1010011100101… |
… | …00101000101000 |
3 | 20002220121022202 |
4 | 11032110220220 |
5 | 134413444431 |
6 | 12410235332 |
7 | 2112635000 |
oct | 516245050 |
9 | 202817282 |
10 | 87640616 |
11 | 4551a768 |
12 | 25425b48 |
13 | 1520706b |
14 | b8d5000 |
15 | 7a628cb |
hex | 5394a28 |
87640616 has 96 divisors (see below), whose sum is σ = 206760000. Its totient is φ = 34715520.
The previous prime is 87640607. The next prime is 87640633. The reversal of 87640616 is 61604678.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a self number, because there is not a number n which added to its sum of digits gives 87640616.
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 23 ways as a sum of consecutive naturals, for example, 2137556 + ... + 2137596.
It is an arithmetic number, because the mean of its divisors is an integer number (2153750).
Almost surely, 287640616 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 87640616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103380000).
87640616 is an abundant number, since it is smaller than the sum of its proper divisors (119119384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87640616 is a wasteful number, since it uses less digits than its factorization.
87640616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128 (or 69 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 38.
The square root of 87640616 is about 9361.6566909923. The cubic root of 87640616 is about 444.1896897994.
The spelling of 87640616 in words is "eighty-seven million, six hundred forty thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •