Base | Representation |
---|---|
bin | 111010011100… |
… | …1000100000000 |
3 | 2010122210111220 |
4 | 1310321010000 |
5 | 30321024212 |
6 | 3012435040 |
7 | 521312352 |
oct | 164710400 |
9 | 63583456 |
10 | 30642432 |
11 | 1632a127 |
12 | a318a80 |
13 | 646b522 |
14 | 40d90d2 |
15 | 2a5438c |
hex | 1d39100 |
30642432 has 72 divisors (see below), whose sum is σ = 86387616. Its totient is φ = 9609216.
The previous prime is 30642431. The next prime is 30642439. The reversal of 30642432 is 23424603.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (30642431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11883 + ... + 14229.
It is an arithmetic number, because the mean of its divisors is an integer number (1199828).
Almost surely, 230642432 is an apocalyptic number.
30642432 is a gapful number since it is divisible by the number (32) 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 30642432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43193808).
30642432 is an abundant number, since it is smaller than the sum of its proper divisors (55745184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30642432 is a wasteful number, since it uses less digits than its factorization.
30642432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2383 (or 2369 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 24.
The square root of 30642432 is about 5535.5606762098. The cubic root of 30642432 is about 312.9255880297.
The spelling of 30642432 in words is "thirty million, six hundred forty-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •