Base | Representation |
---|---|
bin | 1010010000011… |
… | …10110001100100 |
3 | 12222220110211111 |
4 | 11020032301210 |
5 | 134011344443 |
6 | 12312114404 |
7 | 2063234260 |
oct | 510166144 |
9 | 188813744 |
10 | 86043748 |
11 | 44629a3a |
12 | 24995a04 |
13 | 14a9827b |
14 | b5db0a0 |
15 | 784969d |
hex | 520ec64 |
86043748 has 48 divisors (see below), whose sum is σ = 177585408. Its totient is φ = 35712000.
The previous prime is 86043743. The next prime is 86043757. The reversal of 86043748 is 84734068.
It is a self number, because there is not a number n which added to its sum of digits gives 86043748.
It is not an unprimeable number, because it can be changed into a prime (86043743) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 276513 + ... + 276823.
It is an arithmetic number, because the mean of its divisors is an integer number (3699696).
Almost surely, 286043748 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 86043748, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88792704).
86043748 is an abundant number, since it is smaller than the sum of its proper divisors (91541660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86043748 is a wasteful number, since it uses less digits than its factorization.
86043748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604 (or 602 counting only the distinct ones).
The product of its (nonzero) digits is 129024, while the sum is 40.
The square root of 86043748 is about 9275.9769296824. The cubic root of 86043748 is about 441.4753300250.
The spelling of 86043748 in words is "eighty-six million, forty-three thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •