Base | Representation |
---|---|
bin | 111110101010011001101 |
3 | 10212022122002 |
4 | 13311103031 |
5 | 1011201300 |
6 | 112002045 |
7 | 23311241 |
oct | 7652315 |
9 | 3768562 |
10 | 2053325 |
11 | 118276a |
12 | 830325 |
13 | 56b7b1 |
14 | 3b6421 |
15 | 2a85d5 |
hex | 1f54cd |
2053325 has 12 divisors (see below), whose sum is σ = 2657568. Its totient is φ = 1570800.
The previous prime is 2053313. The next prime is 2053333. The reversal of 2053325 is 5233502.
2053325 = T411 + T412 + ... + T433.
It is not a de Polignac number, because 2053325 - 28 = 2053069 is a prime.
It is a super-2 number, since 2×20533252 = 8432287111250, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2053297 and 2053306.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 1211 + ... + 2360.
It is an arithmetic number, because the mean of its divisors is an integer number (221464).
22053325 is an apocalyptic number.
2053325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2053325 is a deficient number, since it is larger than the sum of its proper divisors (604243).
2053325 is a wasteful number, since it uses less digits than its factorization.
2053325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3604 (or 3599 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 20.
The square root of 2053325 is about 1432.9427762475. The cubic root of 2053325 is about 127.1020528428.
Adding to 2053325 its reverse (5233502), we get a palindrome (7286827).
The spelling of 2053325 in words is "two million, fifty-three thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •