Base | Representation |
---|---|
bin | 1011100001110… |
… | …10010101110000 |
3 | 20201222021101000 |
4 | 11300322111300 |
5 | 144224123302 |
6 | 13332442000 |
7 | 2253001245 |
oct | 560722560 |
9 | 221867330 |
10 | 96707952 |
11 | 4a653130 |
12 | 28479300 |
13 | 17060253 |
14 | cbb55cc |
15 | 875431c |
hex | 5c3a570 |
96707952 has 160 divisors (see below), whose sum is σ = 309980160. Its totient is φ = 28615680.
The previous prime is 96707911. The next prime is 96707957. The reversal of 96707952 is 25970769.
It is a junction number, because it is equal to n+sod(n) for n = 96707898 and 96707907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (96707957) 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 31 ways as a sum of consecutive naturals, for example, 223128 + ... + 223560.
It is an arithmetic number, because the mean of its divisors is an integer number (1937376).
Almost surely, 296707952 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 96707952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154990080).
96707952 is an abundant number, since it is smaller than the sum of its proper divisors (213272208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
96707952 is a wasteful number, since it uses less digits than its factorization.
96707952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508 (or 496 counting only the distinct ones).
The product of its (nonzero) digits is 238140, while the sum is 45.
The square root of 96707952 is about 9834.0201342076. The cubic root of 96707952 is about 459.0085008464.
The spelling of 96707952 in words is "ninety-six million, seven hundred seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •