Base | Representation |
---|---|
bin | 1010010100011011100101 |
3 | 12002102201211 |
4 | 22110123211 |
5 | 1143031000 |
6 | 133551421 |
7 | 31664443 |
oct | 12243345 |
9 | 5072654 |
10 | 2705125 |
11 | 1588445 |
12 | aa5571 |
13 | 739387 |
14 | 505b93 |
15 | 3867ba |
hex | 2946e5 |
2705125 has 32 divisors (see below), whose sum is σ = 3818880. Its totient is φ = 1900800.
The previous prime is 2705113. The next prime is 2705137. The reversal of 2705125 is 5215072.
2705125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (2705113) and next prime (2705137).
It is not a de Polignac number, because 2705125 - 25 = 2705093 is a prime.
It is an Ulam number.
It is a junction number, because it is equal to n+sod(n) for n = 2705096 and 2705105.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 40342 + ... + 40408.
It is an arithmetic number, because the mean of its divisors is an integer number (119340).
22705125 is an apocalyptic number.
2705125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2705125 is a deficient number, since it is larger than the sum of its proper divisors (1113755).
2705125 is a wasteful number, since it uses less digits than its factorization.
2705125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118 (or 108 counting only the distinct ones).
The product of its (nonzero) digits is 700, while the sum is 22.
The square root of 2705125 is about 1644.7264210196. The cubic root of 2705125 is about 139.3357135546.
The spelling of 2705125 in words is "two million, seven hundred five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •