Base | Representation |
---|---|
bin | 111011000011… |
… | …1110101100000 |
3 | 2011021012010010 |
4 | 1312013311200 |
5 | 30411340323 |
6 | 3023404520 |
7 | 524125140 |
oct | 166076540 |
9 | 64235103 |
10 | 30965088 |
11 | 1652a590 |
12 | a453740 |
13 | 655234b |
14 | 4180920 |
15 | 2ab9c93 |
hex | 1d87d60 |
30965088 has 192 divisors, whose sum is σ = 104509440. Its totient is φ = 7795200.
The previous prime is 30965087. The next prime is 30965093. The reversal of 30965088 is 88056903.
It is a super-3 number, since 3×309650883 (a number of 23 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30965087) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 436093 + ... + 436163.
It is an arithmetic number, because the mean of its divisors is an integer number (544320).
Almost surely, 230965088 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 30965088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52254720).
30965088 is an abundant number, since it is smaller than the sum of its proper divisors (73544352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30965088 is a wasteful number, since it uses less digits than its factorization.
30965088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161 (or 153 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 39.
The square root of 30965088 is about 5564.6282894727. The cubic root of 30965088 is about 314.0200941878.
The spelling of 30965088 in words is "thirty million, nine hundred sixty-five thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •