Base | Representation |
---|---|
bin | 111001101000… |
… | …0100111010000 |
3 | 2002212001122120 |
4 | 1303100213100 |
5 | 30213331413 |
6 | 2555334240 |
7 | 514551144 |
oct | 163204720 |
9 | 62761576 |
10 | 30214608 |
11 | 16067756 |
12 | a151380 |
13 | 634b888 |
14 | 4027224 |
15 | 29bc723 |
hex | 1cd09d0 |
30214608 has 80 divisors (see below), whose sum is σ = 81423360. Its totient is φ = 9647488.
The previous prime is 30214601. The next prime is 30214609. The reversal of 30214608 is 80641203.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30214601) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 132991 + ... + 133217.
It is an arithmetic number, because the mean of its divisors is an integer number (1017792).
Almost surely, 230214608 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 30214608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40711680).
30214608 is an abundant number, since it is smaller than the sum of its proper divisors (51208752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30214608 is a wasteful number, since it uses less digits than its factorization.
30214608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344 (or 338 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The square root of 30214608 is about 5496.7816038115. The cubic root of 30214608 is about 311.4624207599.
The spelling of 30214608 in words is "thirty million, two hundred fourteen thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •