Base | Representation |
---|---|
bin | 11100011001111000… |
… | …101010001000000000 |
3 | 2220201112100110212120 |
4 | 130121320222020000 |
5 | 444430224212310 |
6 | 22002220324240 |
7 | 2126536453005 |
oct | 343170521000 |
9 | 86645313776 |
10 | 30499054080 |
11 | 11a30a14820 |
12 | 5ab20a3680 |
13 | 2b508a8781 |
14 | 16948358ac |
15 | bd7856b70 |
hex | 719e2a200 |
30499054080 has 640 divisors, whose sum is σ = 112428518400. Its totient is φ = 6984499200.
The previous prime is 30499054057. The next prime is 30499054097. The reversal of 30499054080 is 8045099403.
It is a tau number, because it is divible by the number of its divisors (640).
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 63 ways as a sum of consecutive naturals, for example, 144545175 + ... + 144545385.
It is an arithmetic number, because the mean of its divisors is an integer number (175669560).
Almost surely, 230499054080 is an apocalyptic number.
30499054080 is a gapful number since it is divisible by the number (30) 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 30499054080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56214259200).
30499054080 is an abundant number, since it is smaller than the sum of its proper divisors (81929464320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30499054080 is a wasteful number, since it uses less digits than its factorization.
30499054080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336 (or 320 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 42.
The spelling of 30499054080 in words is "thirty billion, four hundred ninety-nine million, fifty-four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •