Base | Representation |
---|---|
bin | 10010000101110001… |
… | …01111110110000000 |
3 | 221001212001011000020 |
4 | 21002320233312000 |
5 | 124342244410010 |
6 | 4243420053440 |
7 | 462450355260 |
oct | 110270576600 |
9 | 27055034006 |
10 | 9712106880 |
11 | 413425a713 |
12 | 1a70694280 |
13 | bba16b208 |
14 | 681c217a0 |
15 | 3bc991470 |
hex | 242e2fd80 |
9712106880 has 512 divisors, whose sum is σ = 37824537600. Its totient is φ = 2070282240.
The previous prime is 9712106849. The next prime is 9712106881. The reversal of 9712106880 is 886012179.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9712106881) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 18641020 + ... + 18641540.
It is an arithmetic number, because the mean of its divisors is an integer number (73876050).
Almost surely, 29712106880 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 9712106880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18912268800).
9712106880 is an abundant number, since it is smaller than the sum of its proper divisors (28112430720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
9712106880 is a wasteful number, since it uses less digits than its factorization.
9712106880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 642 (or 630 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 42.
The square root of 9712106880 is about 98550.0222222197. The cubic root of 9712106880 is about 2133.5581516542.
The spelling of 9712106880 in words is "nine billion, seven hundred twelve million, one hundred six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •