Base | Representation |
---|---|
bin | 111001111110… |
… | …1100001010000 |
3 | 2010012101222000 |
4 | 1303331201100 |
5 | 30240223134 |
6 | 3003314000 |
7 | 516245331 |
oct | 163754120 |
9 | 63171860 |
10 | 30398544 |
11 | 16182970 |
12 | a21b900 |
13 | 63b4507 |
14 | 4074288 |
15 | 2a06e99 |
hex | 1cfd850 |
30398544 has 80 divisors (see below), whose sum is σ = 95202240. Its totient is φ = 9210240.
The previous prime is 30398527. The next prime is 30398551. The reversal of 30398544 is 44589303.
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 = 30398499 and 30398508.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 1554 + ... + 7950.
It is an arithmetic number, because the mean of its divisors is an integer number (1190028).
Almost surely, 230398544 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 30398544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47601120).
30398544 is an abundant number, since it is smaller than the sum of its proper divisors (64803696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30398544 is a wasteful number, since it uses less digits than its factorization.
30398544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6425 (or 6413 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The square root of 30398544 is about 5513.4874625776. The cubic root of 30398544 is about 312.0931674424.
The spelling of 30398544 in words is "thirty million, three hundred ninety-eight thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •