Base | Representation |
---|---|
bin | 111010001000… |
… | …0111101111000 |
3 | 2010100110020020 |
4 | 1310100331320 |
5 | 30300300300 |
6 | 3005130440 |
7 | 520026504 |
oct | 164207570 |
9 | 63313206 |
10 | 30478200 |
11 | 162277a5 |
12 | a259a20 |
13 | 641184c |
14 | 4095304 |
15 | 2a208a0 |
hex | 1d10f78 |
30478200 has 96 divisors (see below), whose sum is σ = 95827200. Its totient is φ = 8012160.
The previous prime is 30478199. The next prime is 30478213. The reversal of 30478200 is 287403.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 47079 + ... + 47721.
It is an arithmetic number, because the mean of its divisors is an integer number (998200).
Almost surely, 230478200 is an apocalyptic number.
30478200 is a gapful number since it is divisible by the number (30) 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 30478200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47913600).
30478200 is an abundant number, since it is smaller than the sum of its proper divisors (65349000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30478200 is a wasteful number, since it uses less digits than its factorization.
30478200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 741 (or 732 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 24.
The square root of 30478200 is about 5520.7064765300. The cubic root of 30478200 is about 312.3655314799.
The spelling of 30478200 in words is "thirty million, four hundred seventy-eight thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •