Base | Representation |
---|---|
bin | 1011100011001… |
… | …11011001100000 |
3 | 20202022122112120 |
4 | 11301213121200 |
5 | 144301030022 |
6 | 13340424240 |
7 | 2254400313 |
oct | 561473140 |
9 | 222278476 |
10 | 96892512 |
11 | 4a769862 |
12 | 28548080 |
13 | 170c6262 |
14 | cc2297a |
15 | 878dd5c |
hex | 5c67660 |
96892512 has 96 divisors (see below), whose sum is σ = 264176640. Its totient is φ = 31073280.
The previous prime is 96892511. The next prime is 96892531. The reversal of 96892512 is 21529869.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (96892511) 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 15 ways as a sum of consecutive naturals, for example, 405289 + ... + 405527.
It is an arithmetic number, because the mean of its divisors is an integer number (2751840).
Almost surely, 296892512 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 96892512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132088320).
96892512 is an abundant number, since it is smaller than the sum of its proper divisors (167284128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
96892512 is a wasteful number, since it uses less digits than its factorization.
96892512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396 (or 388 counting only the distinct ones).
The product of its digits is 77760, while the sum is 42.
The square root of 96892512 is about 9843.3994128045. The cubic root of 96892512 is about 459.3003099263.
The spelling of 96892512 in words is "ninety-six million, eight hundred ninety-two thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •