Base | Representation |
---|---|
bin | 1010001000111… |
… | …01101001111000 |
3 | 12221001022001200 |
4 | 11010131221320 |
5 | 133233243440 |
6 | 12235014200 |
7 | 2051652012 |
oct | 504355170 |
9 | 187038050 |
10 | 85056120 |
11 | 44014a16 |
12 | 2459a360 |
13 | 14810886 |
14 | b4211b2 |
15 | 7701c30 |
hex | 511da78 |
85056120 has 96 divisors (see below), whose sum is σ = 278104320. Its totient is φ = 22544640.
The previous prime is 85056029. The next prime is 85056121. The reversal of 85056120 is 2165058.
85056120 is a `hidden beast` number, since 85 + 0 + 561 + 20 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (85056121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 68142 + ... + 69378.
It is an arithmetic number, because the mean of its divisors is an integer number (2896920).
Almost surely, 285056120 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 85056120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139052160).
85056120 is an abundant number, since it is smaller than the sum of its proper divisors (193048200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
85056120 is a wasteful number, since it uses less digits than its factorization.
85056120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1445 (or 1438 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The square root of 85056120 is about 9222.5874894197. The cubic root of 85056120 is about 439.7797106655.
The spelling of 85056120 in words is "eighty-five million, fifty-six thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •