Base | Representation |
---|---|
bin | 111010010110… |
… | …0011001100000 |
3 | 2010120011100201 |
4 | 1310230121200 |
5 | 30312344220 |
6 | 3011354544 |
7 | 521005210 |
oct | 164543140 |
9 | 63504321 |
10 | 30590560 |
11 | 162a4160 |
12 | a2b2a54 |
13 | 6450a30 |
14 | 40c4240 |
15 | 2a43d0a |
hex | 1d2c660 |
30590560 has 192 divisors, whose sum is σ = 97542144. Its totient is φ = 8755200.
The previous prime is 30590543. The next prime is 30590591. The reversal of 30590560 is 6509503.
It is a happy number.
It is a super-2 number, since 2×305905602 = 1871564722227200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 160065 + ... + 160255.
It is an arithmetic number, because the mean of its divisors is an integer number (508032).
Almost surely, 230590560 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 30590560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48771072).
30590560 is an abundant number, since it is smaller than the sum of its proper divisors (66951584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30590560 is a wasteful number, since it uses less digits than its factorization.
30590560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237 (or 229 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 28.
The square root of 30590560 is about 5530.8733487579. The cubic root of 30590560 is about 312.7489131492.
The spelling of 30590560 in words is "thirty million, five hundred ninety thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •