Base | Representation |
---|---|
bin | 111010100010… |
… | …1110110110000 |
3 | 2010202110101122 |
4 | 1311011312300 |
5 | 30324213312 |
6 | 3013521412 |
7 | 521621210 |
oct | 165056660 |
9 | 63673348 |
10 | 30694832 |
11 | 16365533 |
12 | a343268 |
13 | 648932c |
14 | 4110240 |
15 | 2a64b72 |
hex | 1d45db0 |
30694832 has 20 divisors (see below), whose sum is σ = 67967376. Its totient is φ = 13154880.
The previous prime is 30694813. The next prime is 30694841. The reversal of 30694832 is 23849603.
It is a happy number.
It is a Smith number, since the sum of its digits (35) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 30694792 and 30694801.
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 3 ways as a sum of consecutive naturals, for example, 136919 + ... + 137142.
Almost surely, 230694832 is an apocalyptic number.
It is an amenable number.
30694832 is an abundant number, since it is smaller than the sum of its proper divisors (37272544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30694832 is a wasteful number, since it uses less digits than its factorization.
30694832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274076 (or 274070 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 35.
The square root of 30694832 is about 5540.2916890720. The cubic root of 30694832 is about 313.1038589424.
The spelling of 30694832 in words is "thirty million, six hundred ninety-four thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •