Base | Representation |
---|---|
bin | 11100000011001110… |
… | …000111101010100000 |
3 | 2212202000211210000000 |
4 | 130003032013222200 |
5 | 443140403213003 |
6 | 21500354300000 |
7 | 2114241416400 |
oct | 340316075240 |
9 | 85660753000 |
10 | 30118804128 |
11 | 11856309366 |
12 | 5a06887600 |
13 | 2abcb908ba |
14 | 165a132800 |
15 | bb42951a3 |
hex | 703387aa0 |
30118804128 has 288 divisors, whose sum is σ = 103462168320. Its totient is φ = 8604392832.
The previous prime is 30118804109. The next prime is 30118804141. The reversal of 30118804128 is 82140881103.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 30118804092 and 30118804101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3424825 + ... + 3433607.
It is an arithmetic number, because the mean of its divisors is an integer number (359243640).
Almost surely, 230118804128 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 30118804128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51731084160).
30118804128 is an abundant number, since it is smaller than the sum of its proper divisors (73343364192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30118804128 is an frugal number, since it uses more digits than its factorization.
30118804128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8828 (or 8795 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 36.
The spelling of 30118804128 in words is "thirty billion, one hundred eighteen million, eight hundred four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •