Base | Representation |
---|---|
bin | 111010111011… |
… | …0001001011000 |
3 | 2011010111201120 |
4 | 1311312021120 |
5 | 30402031012 |
6 | 3022045240 |
7 | 523403661 |
oct | 165661130 |
9 | 64114646 |
10 | 30892632 |
11 | 16490101 |
12 | a419820 |
13 | 6528384 |
14 | 4162368 |
15 | 2aa358c |
hex | 1d76258 |
30892632 has 64 divisors (see below), whose sum is σ = 83539200. Its totient is φ = 9486720.
The previous prime is 30892579. The next prime is 30892633. The reversal of 30892632 is 23629803.
It is a junction number, because it is equal to n+sod(n) for n = 30892593 and 30892602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30892633) 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 15 ways as a sum of consecutive naturals, for example, 15957 + ... + 17787.
It is an arithmetic number, because the mean of its divisors is an integer number (1305300).
Almost surely, 230892632 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 30892632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41769600).
30892632 is an abundant number, since it is smaller than the sum of its proper divisors (52646568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30892632 is a wasteful number, since it uses less digits than its factorization.
30892632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1896 (or 1892 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 33.
The square root of 30892632 is about 5558.1140686388. The cubic root of 30892632 is about 313.7749750228.
The spelling of 30892632 in words is "thirty million, eight hundred ninety-two thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •