Base | Representation |
---|---|
bin | 111001110010… |
… | …1010000010000 |
3 | 2010000100121211 |
4 | 1303211100100 |
5 | 30224033102 |
6 | 3001225504 |
7 | 515352502 |
oct | 163452020 |
9 | 63010554 |
10 | 30299152 |
11 | 16115224 |
12 | a192294 |
13 | 637b1c0 |
14 | 4049d72 |
15 | 29d77d7 |
hex | 1ce5410 |
30299152 has 80 divisors (see below), whose sum is σ = 67551232. Its totient is φ = 13063680.
The previous prime is 30299141. The next prime is 30299197. The reversal of 30299152 is 25199203.
It is a super-3 number, since 3×302991523 (a number of 23 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 238513 + ... + 238639.
Almost surely, 230299152 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 30299152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33775616).
30299152 is an abundant number, since it is smaller than the sum of its proper divisors (37252080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30299152 is a wasteful number, since it uses less digits than its factorization.
30299152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 216 (or 210 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 31.
The square root of 30299152 is about 5504.4665499937. The cubic root of 30299152 is about 311.7526529631.
The spelling of 30299152 in words is "thirty million, two hundred ninety-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •