Base | Representation |
---|---|
bin | 10010000110010000… |
… | …00101000110000000 |
3 | 221002010121100022111 |
4 | 21003020011012000 |
5 | 124344312013310 |
6 | 4244042145104 |
7 | 462526465123 |
oct | 110310050600 |
9 | 27063540274 |
10 | 9716126080 |
11 | 4136555371 |
12 | 1a71ab2194 |
13 | bbac4773b |
14 | 68258a3ba |
15 | 3bced728a |
hex | 243205180 |
9716126080 has 128 divisors (see below), whose sum is σ = 23622490080. Its totient is φ = 3820879872.
The previous prime is 9716126027. The next prime is 9716126081. The reversal of 9716126080 is 806216179.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9716126081) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16838752 + ... + 16839328.
Almost surely, 29716126080 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 9716126080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11811245040).
9716126080 is an abundant number, since it is smaller than the sum of its proper divisors (13906364000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
9716126080 is a wasteful number, since it uses less digits than its factorization.
9716126080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 996 (or 984 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 40.
The square root of 9716126080 is about 98570.4117877165. The cubic root of 9716126080 is about 2133.8524240299.
The spelling of 9716126080 in words is "nine billion, seven hundred sixteen million, one hundred twenty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •