Base | Representation |
---|---|
bin | 111010011100… |
… | …1000110110100 |
3 | 2010122210202120 |
4 | 1310321012310 |
5 | 30321030422 |
6 | 3012435540 |
7 | 521313030 |
oct | 164710664 |
9 | 63583676 |
10 | 30642612 |
11 | 1632a280 |
12 | a318bb0 |
13 | 646b630 |
14 | 40d91c0 |
15 | 2a5445c |
hex | 1d391b4 |
30642612 has 96 divisors (see below), whose sum is σ = 96036864. Its totient is φ = 7344000.
The previous prime is 30642593. The next prime is 30642613. The reversal of 30642612 is 21624603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30642613) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 10737 + ... + 13287.
It is an arithmetic number, because the mean of its divisors is an integer number (1000384).
Almost surely, 230642612 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 30642612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48018432).
30642612 is an abundant number, since it is smaller than the sum of its proper divisors (65394252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30642612 is a wasteful number, since it uses less digits than its factorization.
30642612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2589 (or 2587 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 30642612 is about 5535.5769347016. The cubic root of 30642612 is about 312.9262007584.
Subtracting from 30642612 its reverse (21624603), we obtain a square (9018009 = 30032).
The spelling of 30642612 in words is "thirty million, six hundred forty-two thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •