Base | Representation |
---|---|
bin | 1010001100000001101000 |
3 | 12000200111200 |
4 | 22030001220 |
5 | 1140430241 |
6 | 133124200 |
7 | 31462200 |
oct | 12140150 |
9 | 5020450 |
10 | 2670696 |
11 | 1564596 |
12 | a89660 |
13 | 7267c2 |
14 | 4d7400 |
15 | 37b4b6 |
hex | 28c068 |
2670696 has 72 divisors (see below), whose sum is σ = 8425170. Its totient is φ = 762048.
The previous prime is 2670677. The next prime is 2670709. The reversal of 2670696 is 6960762.
It can be written as a sum of positive squares in only one way, i.e., 2160900 + 509796 = 1470^2 + 714^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 2670696.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 3150 + ... + 3906.
22670696 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2670696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4212585).
2670696 is an abundant number, since it is smaller than the sum of its proper divisors (5754474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2670696 is a wasteful number, since it uses less digits than its factorization.
2670696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 783 (or 769 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 36.
The square root of 2670696 is about 1634.2264225009. The cubic root of 2670696 is about 138.7420643136.
The spelling of 2670696 in words is "two million, six hundred seventy thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •