Base | Representation |
---|---|
bin | 111110101000001011001 |
3 | 10212021001212 |
4 | 13311001121 |
5 | 1011132220 |
6 | 111552505 |
7 | 23305022 |
oct | 7650131 |
9 | 3767055 |
10 | 2052185 |
11 | 1181923 |
12 | 82b735 |
13 | 56b115 |
14 | 3b5c49 |
15 | 2a80c5 |
hex | 1f5059 |
2052185 has 8 divisors (see below), whose sum is σ = 2547720. Its totient is φ = 1585024.
The previous prime is 2052181. The next prime is 2052187. The reversal of 2052185 is 5812502.
It can be written as a sum of positive squares in 4 ways, for example, as 150544 + 1901641 = 388^2 + 1379^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2052185 - 22 = 2052181 is a prime.
It is a super-2 number, since 2×20521852 = 8422926548450, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2052185.
It is not an unprimeable number, because it can be changed into a prime (2052181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6932 + ... + 7221.
It is an arithmetic number, because the mean of its divisors is an integer number (318465).
22052185 is an apocalyptic number.
It is an amenable number.
2052185 is a deficient number, since it is larger than the sum of its proper divisors (495535).
2052185 is a wasteful number, since it uses less digits than its factorization.
2052185 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14187.
The product of its (nonzero) digits is 800, while the sum is 23.
The square root of 2052185 is about 1432.5449382131. The cubic root of 2052185 is about 127.0785262597.
Adding to 2052185 its reverse (5812502), we get a palindrome (7864687).
The spelling of 2052185 in words is "two million, fifty-two thousand, one hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •