Base | Representation |
---|---|
bin | 111010101100… |
… | …0010110100000 |
3 | 2010220022022120 |
4 | 1311120112200 |
5 | 30334124332 |
6 | 3015304240 |
7 | 522355116 |
oct | 165302640 |
9 | 63808276 |
10 | 30770592 |
11 | 16407446 |
12 | a37b080 |
13 | 64b4968 |
14 | 412dab6 |
15 | 2a7c32c |
hex | 1d585a0 |
30770592 has 48 divisors (see below), whose sum is σ = 81158112. Its totient is φ = 10208000.
The previous prime is 30770563. The next prime is 30770609. The reversal of 30770592 is 29507703.
It is a tau number, because it is divible by the number of its divisors (48).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23458 + ... + 24734.
It is an arithmetic number, because the mean of its divisors is an integer number (1690794).
Almost surely, 230770592 is an apocalyptic number.
30770592 is a gapful number since it is divisible by the number (32) 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 30770592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40579056).
30770592 is an abundant number, since it is smaller than the sum of its proper divisors (50387520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30770592 is a wasteful number, since it uses less digits than its factorization.
30770592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1541 (or 1533 counting only the distinct ones).
The product of its (nonzero) digits is 13230, while the sum is 33.
The square root of 30770592 is about 5547.1246605787. The cubic root of 30770592 is about 313.3612449357.
The spelling of 30770592 in words is "thirty million, seven hundred seventy thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •