Base | Representation |
---|---|
bin | 111010000110… |
… | …1111001000000 |
3 | 2010022210221120 |
4 | 1310031321000 |
5 | 30244344400 |
6 | 3004552240 |
7 | 516644664 |
oct | 164157100 |
9 | 63283846 |
10 | 30465600 |
11 | 16219290 |
12 | a252680 |
13 | 6408ba9 |
14 | 40908a4 |
15 | 2a1bca0 |
hex | 1d0de40 |
30465600 has 168 divisors, whose sum is σ = 109228128. Its totient is φ = 7372800.
The previous prime is 30465599. The next prime is 30465613. The reversal of 30465600 is 656403.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 52512 + ... + 53088.
Almost surely, 230465600 is an apocalyptic number.
30465600 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 30465600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54614064).
30465600 is an abundant number, since it is smaller than the sum of its proper divisors (78762528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30465600 is a wasteful number, since it uses less digits than its factorization.
30465600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613 (or 598 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 30465600 is about 5519.5652002671. The cubic root of 30465600 is about 312.3224805103.
It can be divided in two parts, 3046 and 5600, that added together give a triangular number (8646 = T131).
The spelling of 30465600 in words is "thirty million, four hundred sixty-five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •