Base | Representation |
---|---|
bin | 111101011000000010000 |
3 | 10210011210010 |
4 | 13223000100 |
5 | 1003324102 |
6 | 111034520 |
7 | 23044263 |
oct | 7530020 |
9 | 3704703 |
10 | 2011152 |
11 | 1154010 |
12 | 80ba40 |
13 | 555540 |
14 | 3a4cda |
15 | 29ad6c |
hex | 1eb010 |
2011152 has 80 divisors (see below), whose sum is σ = 6124608. Its totient is φ = 560640.
The previous prime is 2011147. The next prime is 2011171. The reversal of 2011152 is 2511102.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a nialpdrome in base 13.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6718 + ... + 7010.
22011152 is an apocalyptic number.
2011152 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2011152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3062304).
2011152 is an abundant number, since it is smaller than the sum of its proper divisors (4113456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011152 is a wasteful number, since it uses less digits than its factorization.
2011152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328 (or 322 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 12.
The square root of 2011152 is about 1418.1509087541. The cubic root of 2011152 is about 126.2258484010.
Adding to 2011152 its reverse (2511102), we get a palindrome (4522254).
The spelling of 2011152 in words is "two million, eleven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •