Base | Representation |
---|---|
bin | 111010001110… |
… | …1000000101100 |
3 | 2010102221220100 |
4 | 1310131000230 |
5 | 30303340112 |
6 | 3010151100 |
7 | 520323360 |
oct | 164350054 |
9 | 63387810 |
10 | 30527532 |
11 | 16260872 |
12 | a282490 |
13 | 642b139 |
14 | 40a92a0 |
15 | 2a302dc |
hex | 1d1d02c |
30527532 has 108 divisors (see below), whose sum is σ = 92594320. Its totient is φ = 8306496.
The previous prime is 30527527. The next prime is 30527533. The reversal of 30527532 is 23572503.
It is a super-2 number, since 2×305275322 = 1863860420022048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30527496 and 30527505.
It is not an unprimeable number, because it can be changed into a prime (30527533) by changing a digit.
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 35 ways as a sum of consecutive naturals, for example, 133194 + ... + 133422.
Almost surely, 230527532 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 30527532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46297160).
30527532 is an abundant number, since it is smaller than the sum of its proper divisors (62066788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30527532 is a wasteful number, since it uses less digits than its factorization.
30527532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292 (or 264 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 27.
The square root of 30527532 is about 5525.1725764903. The cubic root of 30527532 is about 312.5339722000.
The spelling of 30527532 in words is "thirty million, five hundred twenty-seven thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •