Base | Representation |
---|---|
bin | 1010011101000… |
… | …11100011101110 |
3 | 20010000201011200 |
4 | 11032203203232 |
5 | 134422423432 |
6 | 12411430330 |
7 | 2113311132 |
oct | 516434356 |
9 | 203021150 |
10 | 87701742 |
11 | 45561687 |
12 | 254553a6 |
13 | 15228b2b |
14 | b90d3c2 |
15 | 7a75a7c |
hex | 53a38ee |
87701742 has 48 divisors (see below), whose sum is σ = 208157040. Its totient is φ = 26562816.
The previous prime is 87701741. The next prime is 87701743. The reversal of 87701742 is 24710778.
It is an interprime number because it is at equal distance from previous prime (87701741) and next prime (87701743).
It is a junction number, because it is equal to n+sod(n) for n = 87701697 and 87701706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (87701741) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3933 + ... + 13815.
It is an arithmetic number, because the mean of its divisors is an integer number (4336605).
Almost surely, 287701742 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 87701742, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (104078520).
87701742 is an abundant number, since it is smaller than the sum of its proper divisors (120455298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87701742 is a wasteful number, since it uses less digits than its factorization.
87701742 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9937 (or 9934 counting only the distinct ones).
The product of its (nonzero) digits is 21952, while the sum is 36.
The square root of 87701742 is about 9364.9208218756. The cubic root of 87701742 is about 444.2929342777.
The spelling of 87701742 in words is "eighty-seven million, seven hundred one thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •