Base | Representation |
---|---|
bin | 1010001001101… |
… | …01001100011000 |
3 | 12221020012022122 |
4 | 11010311030120 |
5 | 133244340121 |
6 | 12241040412 |
7 | 2052533060 |
oct | 504651430 |
9 | 187205278 |
10 | 85152536 |
11 | 440803a7 |
12 | 24626108 |
13 | 14845721 |
14 | b4483a0 |
15 | 77205ab |
hex | 5135318 |
85152536 has 64 divisors (see below), whose sum is σ = 190095360. Its totient is φ = 34992000.
The previous prime is 85152533. The next prime is 85152553. The reversal of 85152536 is 63525158.
It is a junction number, because it is equal to n+sod(n) for n = 85152496 and 85152505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (85152533) 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, 314081 + ... + 314351.
It is an arithmetic number, because the mean of its divisors is an integer number (2970240).
Almost surely, 285152536 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 85152536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95047680).
85152536 is an abundant number, since it is smaller than the sum of its proper divisors (104942824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
85152536 is a wasteful number, since it uses less digits than its factorization.
85152536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496 (or 492 counting only the distinct ones).
The product of its digits is 36000, while the sum is 35.
The square root of 85152536 is about 9227.8131753953. The cubic root of 85152536 is about 439.9458197750.
The spelling of 85152536 in words is "eighty-five million, one hundred fifty-two thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •