Base | Representation |
---|---|
bin | 111110101001100100100 |
3 | 10212022001100 |
4 | 13311030210 |
5 | 1011143100 |
6 | 112000100 |
7 | 23310063 |
oct | 7651444 |
9 | 3768040 |
10 | 2052900 |
11 | 1182413 |
12 | 830030 |
13 | 56b545 |
14 | 3b61da |
15 | 2a8400 |
hex | 1f5324 |
2052900 has 54 divisors (see below), whose sum is σ = 6437522. Its totient is φ = 547200.
The previous prime is 2052899. The next prime is 2052907. The reversal of 2052900 is 92502.
It can be written as a sum of positive squares in 3 ways, for example, as 181476 + 1871424 = 426^2 + 1368^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (2052907) 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 17 ways as a sum of consecutive naturals, for example, 241 + ... + 2040.
22052900 is an apocalyptic number.
2052900 is a gapful number since it is divisible by the number (20) 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 2052900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3218761).
2052900 is an abundant number, since it is smaller than the sum of its proper divisors (4384622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2052900 is a wasteful number, since it uses less digits than its factorization.
2052900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2301 (or 2291 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 2052900 is about 1432.7944723511. The cubic root of 2052900 is about 127.0932829858.
The spelling of 2052900 in words is "two million, fifty-two thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •