Base | Representation |
---|---|
bin | 110010110001010111… |
… | …0010011001101100000 |
3 | 101102102112002121101202 |
4 | 1211202232103031200 |
5 | 3241243301040010 |
6 | 122030553420332 |
7 | 10606606563410 |
oct | 1454256231540 |
9 | 342375077352 |
10 | 109030486880 |
11 | 4226a95a5a7 |
12 | 1916a10a6a8 |
13 | a3876a54c3 |
14 | 53c4530640 |
15 | 2c81e396a5 |
hex | 1962b93360 |
109030486880 has 192 divisors, whose sum is σ = 304250204160. Its totient is φ = 36131788800.
The previous prime is 109030486879. The next prime is 109030486897. The reversal of 109030486880 is 88684030901.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41002991 + ... + 41005649.
It is an arithmetic number, because the mean of its divisors is an integer number (1584636480).
Almost surely, 2109030486880 is an apocalyptic number.
109030486880 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 109030486880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152125102080).
109030486880 is an abundant number, since it is smaller than the sum of its proper divisors (195219717280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109030486880 is a wasteful number, since it uses less digits than its factorization.
109030486880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3893 (or 3885 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 47.
The spelling of 109030486880 in words is "one hundred nine billion, thirty million, four hundred eighty-six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •