Base | Representation |
---|---|
bin | 111010011100… |
… | …0111010101000 |
3 | 2010122202200200 |
4 | 1310320322220 |
5 | 30321014312 |
6 | 3012432200 |
7 | 521310534 |
oct | 164707250 |
9 | 63582620 |
10 | 30641832 |
11 | 16329731 |
12 | a318660 |
13 | 646b180 |
14 | 40d8bc4 |
15 | 2a540dc |
hex | 1d38ea8 |
30641832 has 96 divisors (see below), whose sum is σ = 94130400. Its totient is φ = 8926848.
The previous prime is 30641797. The next prime is 30641833. The reversal of 30641832 is 23814603.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 30641796 and 30641805.
It is not an unprimeable number, because it can be changed into a prime (30641833) 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 23 ways as a sum of consecutive naturals, for example, 16923 + ... + 18645.
It is an arithmetic number, because the mean of its divisors is an integer number (980525).
Almost surely, 230641832 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 30641832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47065200).
30641832 is an abundant number, since it is smaller than the sum of its proper divisors (63488568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30641832 is a wasteful number, since it uses less digits than its factorization.
30641832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1767 (or 1760 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 30641832 is about 5535.5064808922. The cubic root of 30641832 is about 312.9235455832.
The spelling of 30641832 in words is "thirty million, six hundred forty-one thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •