Base | Representation |
---|---|
bin | 111001010100010… |
… | …111100111111000 |
3 | 2111000111102101120 |
4 | 321110113213320 |
5 | 3432140002302 |
6 | 235231145240 |
7 | 32554545636 |
oct | 7124274770 |
9 | 2430442346 |
10 | 961640952 |
11 | 453904098 |
12 | 22a075220 |
13 | 1242c951c |
14 | 91a04356 |
15 | 596559bc |
hex | 395179f8 |
961640952 has 64 divisors (see below), whose sum is σ = 2488811520. Its totient is φ = 309391488.
The previous prime is 961640947. The next prime is 961640959. The reversal of 961640952 is 259046169.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (961640959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 108513 + ... + 117039.
It is an arithmetic number, because the mean of its divisors is an integer number (38887680).
Almost surely, 2961640952 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 961640952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1244405760).
961640952 is an abundant number, since it is smaller than the sum of its proper divisors (1527170568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
961640952 is a wasteful number, since it uses less digits than its factorization.
961640952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8700 (or 8696 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 42.
The square root of 961640952 is about 31010.3362123019. The cubic root of 961640952 is about 987.0465841739.
The spelling of 961640952 in words is "nine hundred sixty-one million, six hundred forty thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •