Base | Representation |
---|---|
bin | 1010010100011011101010 |
3 | 12002102202000 |
4 | 22110123222 |
5 | 1143031010 |
6 | 133551430 |
7 | 31664451 |
oct | 12243352 |
9 | 5072660 |
10 | 2705130 |
11 | 158844a |
12 | aa5576 |
13 | 73938c |
14 | 505b98 |
15 | 3867c0 |
hex | 2946ea |
2705130 has 64 divisors (see below), whose sum is σ = 7413120. Its totient is φ = 701568.
The previous prime is 2705113. The next prime is 2705137. The reversal of 2705130 is 315072.
2705130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (2705137) 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 31 ways as a sum of consecutive naturals, for example, 11494 + ... + 11726.
It is an arithmetic number, because the mean of its divisors is an integer number (115830).
22705130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2705130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3706560).
2705130 is an abundant number, since it is smaller than the sum of its proper divisors (4707990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2705130 is a wasteful number, since it uses less digits than its factorization.
2705130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292 (or 286 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 18.
The square root of 2705130 is about 1644.7279410285. The cubic root of 2705130 is about 139.3357994013.
The spelling of 2705130 in words is "two million, seven hundred five thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •