Base | Representation |
---|---|
bin | 1010001111000… |
… | …01001101111110 |
3 | 12222112222212110 |
4 | 11013201031332 |
5 | 133434412100 |
6 | 12304114450 |
7 | 2061526251 |
oct | 507411576 |
9 | 188488773 |
10 | 85857150 |
11 | 44511825 |
12 | 24905a26 |
13 | 14a31362 |
14 | b58d098 |
15 | 780e250 |
hex | 51e137e |
85857150 has 48 divisors (see below), whose sum is σ = 216129024. Its totient is φ = 22550880.
The previous prime is 85857133. The next prime is 85857151. The reversal of 85857150 is 5175858.
It is a super-2 number, since 2×858571502 = 14742900412245000, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 85857099 and 85857108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (85857151) 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, 5779 + ... + 14321.
It is an arithmetic number, because the mean of its divisors is an integer number (4502688).
Almost surely, 285857150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 85857150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (108064512).
85857150 is an abundant number, since it is smaller than the sum of its proper divisors (130271874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
85857150 is a wasteful number, since it uses less digits than its factorization.
85857150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8625 (or 8620 counting only the distinct ones).
The product of its (nonzero) digits is 56000, while the sum is 39.
The square root of 85857150 is about 9265.9133386839. The cubic root of 85857150 is about 441.1559652169.
The spelling of 85857150 in words is "eighty-five million, eight hundred fifty-seven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •