Base | Representation |
---|---|
bin | 10000001000100011… |
… | …10111001100000000 |
3 | 211100122120021020220 |
4 | 20010101313030000 |
5 | 120214400212302 |
6 | 3551254503040 |
7 | 424434312225 |
oct | 100421671400 |
9 | 24318507226 |
10 | 8661725952 |
11 | 3745355a00 |
12 | 1818964a80 |
13 | a80671439 |
14 | 5c251b94c |
15 | 35a65c4bc |
hex | 204477300 |
8661725952 has 216 divisors, whose sum is σ = 25667178432. Its totient is φ = 2590832640.
The previous prime is 8661725921. The next prime is 8661725959. The reversal of 8661725952 is 2595271668.
It is a junction number, because it is equal to n+sod(n) for n = 8661725895 and 8661725904.
It is not an unprimeable number, because it can be changed into a prime (8661725959) 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 23 ways as a sum of consecutive naturals, for example, 7712463 + ... + 7713585.
Almost surely, 28661725952 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 8661725952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12833589216).
8661725952 is an abundant number, since it is smaller than the sum of its proper divisors (17005452480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8661725952 is a wasteful number, since it uses less digits than its factorization.
8661725952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1247 (or 1222 counting only the distinct ones).
The product of its digits is 1814400, while the sum is 51.
The square root of 8661725952 is about 93068.3939476770. The cubic root of 8661725952 is about 2053.6896433822.
The spelling of 8661725952 in words is "eight billion, six hundred sixty-one million, seven hundred twenty-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •