Base | Representation |
---|---|
bin | 111010010100… |
… | …0111001001000 |
3 | 2010112102122212 |
4 | 1310220321020 |
5 | 30311414300 |
6 | 3011204252 |
7 | 520615304 |
oct | 164507110 |
9 | 63472585 |
10 | 30576200 |
11 | 16294396 |
12 | a2a6688 |
13 | 6447335 |
14 | 40bcd04 |
15 | 2a3e935 |
hex | 1d28e48 |
30576200 has 108 divisors (see below), whose sum is σ = 78943515. Its totient is φ = 11010560.
The previous prime is 30576191. The next prime is 30576229. The reversal of 30576200 is 267503.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 5 ways, for example, as 19909444 + 10666756 = 4462^2 + 3266^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=3910.
It is a Harshad number since it is a multiple of its sum of digits (23).
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 26 ways as a sum of consecutive naturals, for example, 1329389 + ... + 1329411.
Almost surely, 230576200 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 30576200
30576200 is an abundant number, since it is smaller than the sum of its proper divisors (48367315).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30576200 is a wasteful number, since it uses less digits than its factorization.
30576200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96 (or 47 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 23.
The square root of 30576200 is about 5529.5750288788. The cubic root of 30576200 is about 312.6999680136.
The spelling of 30576200 in words is "thirty million, five hundred seventy-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •