Base | Representation |
---|---|
bin | 111010111011… |
… | …0111111110000 |
3 | 2011010200111110 |
4 | 1311312333300 |
5 | 30402133422 |
6 | 3022113320 |
7 | 523420062 |
oct | 165667760 |
9 | 64120443 |
10 | 30896112 |
11 | 16492785 |
12 | a41b840 |
13 | 6529b30 |
14 | 4163732 |
15 | 2aa460c |
hex | 1d76ff0 |
30896112 has 80 divisors (see below), whose sum is σ = 87355520. Its totient is φ = 9351936.
The previous prime is 30896111. The next prime is 30896137. The reversal of 30896112 is 21169803.
It is a self number, because there is not a number n which added to its sum of digits gives 30896112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30896111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41439 + ... + 42177.
It is an arithmetic number, because the mean of its divisors is an integer number (1091944).
Almost surely, 230896112 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 30896112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43677760).
30896112 is an abundant number, since it is smaller than the sum of its proper divisors (56459408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30896112 is a wasteful number, since it uses less digits than its factorization.
30896112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 830 (or 824 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 30.
The square root of 30896112 is about 5558.4271156506. The cubic root of 30896112 is about 313.7867566446.
The spelling of 30896112 in words is "thirty million, eight hundred ninety-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •