Base | Representation |
---|---|
bin | 1000000110110101100000 |
3 | 10222222011100 |
4 | 20012311200 |
5 | 1021001102 |
6 | 113314400 |
7 | 24030531 |
oct | 10066540 |
9 | 3888140 |
10 | 2125152 |
11 | 1221727 |
12 | 865a00 |
13 | 5953b3 |
14 | 3d4688 |
15 | 2bea1c |
hex | 206d60 |
2125152 has 72 divisors (see below), whose sum is σ = 6211296. Its totient is φ = 688896.
The previous prime is 2125147. The next prime is 2125157. The reversal of 2125152 is 2515212.
It is an interprime number because it is at equal distance from previous prime (2125147) and next prime (2125157).
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2125157) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13458 + ... + 13614.
It is an arithmetic number, because the mean of its divisors is an integer number (86268).
22125152 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 2125152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3105648).
2125152 is an abundant number, since it is smaller than the sum of its proper divisors (4086144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2125152 is a wasteful number, since it uses less digits than its factorization.
2125152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220 (or 209 counting only the distinct ones).
The product of its digits is 200, while the sum is 18.
The square root of 2125152 is about 1457.7901083489. The cubic root of 2125152 is about 128.5671448308.
The spelling of 2125152 in words is "two million, one hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •