Base | Representation |
---|---|
bin | 1010011010110… |
… | …10110111111111 |
3 | 20002110120210100 |
4 | 11031122313333 |
5 | 134333412111 |
6 | 12401212143 |
7 | 2110631151 |
oct | 515326777 |
9 | 202416710 |
10 | 87404031 |
11 | 45378a40 |
12 | 25331053 |
13 | 15153480 |
14 | b872ad1 |
15 | 7a17756 |
hex | 535adff |
87404031 has 48 divisors (see below), whose sum is σ = 149883552. Its totient is φ = 48384000.
The previous prime is 87404029. The next prime is 87404059. The reversal of 87404031 is 13040478.
87404031 is a nontrivial binomial coefficient, being equal to C(13222, 2).
It is not a de Polignac number, because 87404031 - 21 = 87404029 is a prime.
It is a super-2 number, since 2×874040312 = 15278929270097922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 87403986 and 87404004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (87404131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 145131 + ... + 145731.
It is an arithmetic number, because the mean of its divisors is an integer number (3122574).
Almost surely, 287404031 is an apocalyptic number.
87404031 is the 13221-st triangular number and also the 6611-st hexagonal number.
87404031 is a deficient number, since it is larger than the sum of its proper divisors (62479521).
87404031 is a wasteful number, since it uses less digits than its factorization.
87404031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 744 (or 741 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 87404031 is about 9349.0123007727. The cubic root of 87404031 is about 443.7896343360.
The spelling of 87404031 in words is "eighty-seven million, four hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •