Base | Representation |
---|---|
bin | 111001010111… |
… | …0111111111000 |
3 | 2002121001210000 |
4 | 1302232333320 |
5 | 30144430140 |
6 | 2552353000 |
7 | 513435546 |
oct | 162567770 |
9 | 62531700 |
10 | 30076920 |
11 | 15a83265 |
12 | a0a5760 |
13 | 6300cc3 |
14 | 3dccd96 |
15 | 2991a30 |
hex | 1caeff8 |
30076920 has 80 divisors (see below), whose sum is σ = 101102760. Its totient is φ = 8019648.
The previous prime is 30076901. The next prime is 30076931. The reversal of 30076920 is 2967003.
It is a super-2 number, since 2×300769202 = 1809242233372800, which contains 22 as substring.
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 (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1402 + ... + 7881.
Almost surely, 230076920 is an apocalyptic number.
30076920 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 30076920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50551380).
30076920 is an abundant number, since it is smaller than the sum of its proper divisors (71025840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30076920 is a wasteful number, since it uses less digits than its factorization.
30076920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9306 (or 9293 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 30076920 is about 5484.2428830241. The cubic root of 30076920 is about 310.9885887536.
The spelling of 30076920 in words is "thirty million, seventy-six thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •