Base | Representation |
---|---|
bin | 111001101101… |
… | …1011101000000 |
3 | 2002221022120000 |
4 | 1303123131000 |
5 | 30221242013 |
6 | 3000320000 |
7 | 515124453 |
oct | 163333500 |
9 | 62838500 |
10 | 30259008 |
11 | 1609804a |
12 | a173000 |
13 | 6365b50 |
14 | 403949a |
15 | 29ca973 |
hex | 1cdb740 |
30259008 has 140 divisors (see below), whose sum is σ = 96812100. Its totient is φ = 9289728.
The previous prime is 30258983. The next prime is 30259013. The reversal of 30259008 is 80095203.
It can be written as a sum of positive squares in 2 ways, for example, as 10969344 + 19289664 = 3312^2 + 4392^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
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 19 ways as a sum of consecutive naturals, for example, 67168 + ... + 67616.
It is an arithmetic number, because the mean of its divisors is an integer number (691515).
Almost surely, 230259008 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 30259008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48406050).
30259008 is an abundant number, since it is smaller than the sum of its proper divisors (66553092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30259008 is a wasteful number, since it uses less digits than its factorization.
30259008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486 (or 467 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 30259008 is about 5500.8188481352. The cubic root of 30259008 is about 311.6149095074.
The spelling of 30259008 in words is "thirty million, two hundred fifty-nine thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •