Base | Representation |
---|---|
bin | 1010111000010011100110 |
3 | 12100220022020 |
4 | 22320103212 |
5 | 1212231240 |
6 | 141044010 |
7 | 33146034 |
oct | 12702346 |
9 | 5326266 |
10 | 2852070 |
11 | 1678891 |
12 | b56606 |
13 | 78b220 |
14 | 543554 |
15 | 3b50d0 |
hex | 2b84e6 |
2852070 has 64 divisors (see below), whose sum is σ = 7547904. Its totient is φ = 685440.
The previous prime is 2852053. The next prime is 2852077. The reversal of 2852070 is 702582.
2852070 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2852070.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2852077) 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, 27639 + ... + 27741.
It is an arithmetic number, because the mean of its divisors is an integer number (117936).
22852070 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2852070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3773952).
2852070 is an abundant number, since it is smaller than the sum of its proper divisors (4695834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2852070 is a wasteful number, since it uses less digits than its factorization.
2852070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197.
The product of its (nonzero) digits is 1120, while the sum is 24.
The square root of 2852070 is about 1688.8072714197. The cubic root of 2852070 is about 141.8143112774.
The spelling of 2852070 in words is "two million, eight hundred fifty-two thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •