Base | Representation |
---|---|
bin | 11100011001010111… |
… | …110011111110000000 |
3 | 2220200221011000120200 |
4 | 130121113303332000 |
5 | 444421023144043 |
6 | 22001312005200 |
7 | 2126403331500 |
oct | 343127637600 |
9 | 86627130520 |
10 | 30490443648 |
11 | 11a27073665 |
12 | 5aab230800 |
13 | 2b4bb82542 |
14 | 1693633a00 |
15 | bd6c057d3 |
hex | 7195f3f80 |
30490443648 has 288 divisors, whose sum is σ = 107439813000. Its totient is φ = 8252762112.
The previous prime is 30490443623. The next prime is 30490443689. The reversal of 30490443648 is 84634409403.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (288).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1058298 + ... + 1086726.
Almost surely, 230490443648 is an apocalyptic number.
30490443648 is a gapful number since it is divisible by the number (38) 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 30490443648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53719906500).
30490443648 is an abundant number, since it is smaller than the sum of its proper divisors (76949369352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30490443648 is a wasteful number, since it uses less digits than its factorization.
30490443648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28482 (or 28460 counting only the distinct ones).
The product of its (nonzero) digits is 995328, while the sum is 45.
The spelling of 30490443648 in words is "thirty billion, four hundred ninety million, four hundred forty-three thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •