Base | Representation |
---|---|
bin | 111001111010… |
… | …1000110000000 |
3 | 2010010122121210 |
4 | 1303311012000 |
5 | 30233122112 |
6 | 3002450120 |
7 | 516042606 |
oct | 163650600 |
9 | 63118553 |
10 | 30364032 |
11 | 16159a46 |
12 | a203940 |
13 | 63a18aa |
14 | 4065876 |
15 | 29ebb3c |
hex | 1cf5180 |
30364032 has 64 divisors (see below), whose sum is σ = 81518400. Its totient is φ = 10013184.
The previous prime is 30363997. The next prime is 30364069. The reversal of 30364032 is 23046303.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 40719 + ... + 41457.
It is an arithmetic number, because the mean of its divisors is an integer number (1273725).
Almost surely, 230364032 is an apocalyptic number.
30364032 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 30364032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40759200).
30364032 is an abundant number, since it is smaller than the sum of its proper divisors (51154368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30364032 is a wasteful number, since it uses less digits than its factorization.
30364032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 863 (or 851 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
The square root of 30364032 is about 5510.3567942557. The cubic root of 30364032 is about 311.9750144357.
The spelling of 30364032 in words is "thirty million, three hundred sixty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •