Base | Representation |
---|---|
bin | 1010111111101001101000 |
3 | 12102102120101 |
4 | 22333221220 |
5 | 1214212102 |
6 | 141435144 |
7 | 33332530 |
oct | 12775150 |
9 | 5372511 |
10 | 2882152 |
11 | 1699449 |
12 | b6bab4 |
13 | 79bb20 |
14 | 5504c0 |
15 | 3bde87 |
hex | 2bfa68 |
2882152 has 64 divisors (see below), whose sum is σ = 6894720. Its totient is φ = 1099008.
The previous prime is 2882149. The next prime is 2882179. The reversal of 2882152 is 2512882.
It is a super-2 number, since 2×28821522 = 16613600302208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 2882152.
It is an unprimeable number.
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, 26883 + ... + 26989.
It is an arithmetic number, because the mean of its divisors is an integer number (107730).
22882152 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 2882152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3447360).
2882152 is an abundant number, since it is smaller than the sum of its proper divisors (4012568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2882152 is a wasteful number, since it uses less digits than its factorization.
2882152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170 (or 166 counting only the distinct ones).
The product of its digits is 2560, while the sum is 28.
The square root of 2882152 is about 1697.6901955304. The cubic root of 2882152 is about 142.3111605530.
The spelling of 2882152 in words is "two million, eight hundred eighty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •