Base | Representation |
---|---|
bin | 10010100111100000… |
… | …10100100110010000 |
3 | 221210120120020101220 |
4 | 21103300110212100 |
5 | 130432222021200 |
6 | 4331445525040 |
7 | 502455016503 |
oct | 112360244620 |
9 | 27716506356 |
10 | 9995110800 |
11 | 4269a85754 |
12 | 1b2b413780 |
13 | c33997c5c |
14 | 6ab64d13a |
15 | 3d77444a0 |
hex | 253c14990 |
9995110800 has 120 divisors (see below), whose sum is σ = 32073259680. Its totient is φ = 2660736000.
The previous prime is 9995110789. The next prime is 9995110813. The reversal of 9995110800 is 80115999.
It is a tau number, because it is divible by the number of its divisors (120).
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 23 ways as a sum of consecutive naturals, for example, 714271 + ... + 728129.
It is an arithmetic number, because the mean of its divisors is an integer number (267277164).
Almost surely, 29995110800 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 9995110800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16036629840).
9995110800 is an abundant number, since it is smaller than the sum of its proper divisors (22078148880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
9995110800 is a wasteful number, since it uses less digits than its factorization.
9995110800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14481 (or 14470 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 42.
The square root of 9995110800 is about 99975.5510112347. The cubic root of 9995110800 is about 2154.0835173910.
The spelling of 9995110800 in words is "nine billion, nine hundred ninety-five million, one hundred ten thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •