Base | Representation |
---|---|
bin | 10010100111101011101100 |
3 | 100011222122200 |
4 | 102213223230 |
5 | 2222144012 |
6 | 252341500 |
7 | 56326464 |
oct | 22475354 |
9 | 10158580 |
10 | 4881132 |
11 | 28342a3 |
12 | 1774890 |
13 | 101b959 |
14 | 910ba4 |
15 | 6663dc |
hex | 4a7aec |
4881132 has 36 divisors (see below), whose sum is σ = 12643176. Its totient is φ = 1586880.
The previous prime is 4881131. The next prime is 4881133. The reversal of 4881132 is 2311884.
It is an interprime number because it is at equal distance from previous prime (4881131) and next prime (4881133).
It is a tau number, because it is divible by the number of its divisors (36).
It is a junction number, because it is equal to n+sod(n) for n = 4881096 and 4881105.
It is not an unprimeable number, because it can be changed into a prime (4881131) 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 11 ways as a sum of consecutive naturals, for example, 178 + ... + 3129.
Almost surely, 24881132 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 4881132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6321588).
4881132 is an abundant number, since it is smaller than the sum of its proper divisors (7762044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4881132 is a wasteful number, since it uses less digits than its factorization.
4881132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3358 (or 3353 counting only the distinct ones).
The product of its digits is 1536, while the sum is 27.
The square root of 4881132 is about 2209.3284047420. The cubic root of 4881132 is about 169.6316360677.
The spelling of 4881132 in words is "four million, eight hundred eighty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •