Base | Representation |
---|---|
bin | 10000101001101110… |
… | …00011001101000000 |
3 | 212002001000110222000 |
4 | 20110313003031000 |
5 | 121302104104302 |
6 | 4035033144000 |
7 | 434352660261 |
oct | 102467031500 |
9 | 25061013860 |
10 | 8939909952 |
11 | 3878389736 |
12 | 1895b5b000 |
13 | ac61a135c |
14 | 60b452968 |
15 | 374cac31c |
hex | 214dc3340 |
8939909952 has 224 divisors, whose sum is σ = 28728253440. Its totient is φ = 2713927680.
The previous prime is 8939909933. The next prime is 8939909981. The reversal of 8939909952 is 2599099398.
It is a self number, because there is not a number n which added to its sum of digits gives 8939909952.
It is a congruent number.
It is an unprimeable number.
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, 905748 + ... + 915564.
Almost surely, 28939909952 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 8939909952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14364126720).
8939909952 is an abundant number, since it is smaller than the sum of its proper divisors (19788343488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8939909952 is a wasteful number, since it uses less digits than its factorization.
8939909952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9886 (or 9870 counting only the distinct ones).
The product of its (nonzero) digits is 14171760, while the sum is 63.
The square root of 8939909952 is about 94551.0970428160. The cubic root of 8939909952 is about 2075.4441359841. Note that the first 3 decimals are identical.
The spelling of 8939909952 in words is "eight billion, nine hundred thirty-nine million, nine hundred nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •