Base | Representation |
---|---|
bin | 1010001111101… |
… | …11100011011000 |
3 | 12222201122100200 |
4 | 11013313203120 |
5 | 134000324012 |
6 | 12310102200 |
7 | 2062360050 |
oct | 507674330 |
9 | 188648320 |
10 | 85948632 |
11 | 44574530 |
12 | 2494a960 |
13 | 14a63ba3 |
14 | b5b4560 |
15 | 782b3dc |
hex | 51f78d8 |
85948632 has 192 divisors, whose sum is σ = 298771200. Its totient is φ = 21669120.
The previous prime is 85948619. The next prime is 85948637. The reversal of 85948632 is 23684958.
85948632 is a `hidden beast` number, since 8 + 5 + 9 + 4 + 8 + 632 = 666.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (85948637) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 204919 + ... + 205337.
It is an arithmetic number, because the mean of its divisors is an integer number (1556100).
Almost surely, 285948632 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 85948632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149385600).
85948632 is an abundant number, since it is smaller than the sum of its proper divisors (212822568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
85948632 is a wasteful number, since it uses less digits than its factorization.
85948632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486 (or 479 counting only the distinct ones).
The product of its digits is 414720, while the sum is 45.
The square root of 85948632 is about 9270.8485048565. The cubic root of 85948632 is about 441.3125955598.
The spelling of 85948632 in words is "eighty-five million, nine hundred forty-eight thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •