Base | Representation |
---|---|
bin | 1010101111100011010000 |
3 | 12022002010000 |
4 | 22233203100 |
5 | 1210104313 |
6 | 140210000 |
7 | 32636343 |
oct | 12574320 |
9 | 5262100 |
10 | 2816208 |
11 | 165394a |
12 | b39900 |
13 | 777ac5 |
14 | 53445a |
15 | 3a9673 |
hex | 2af8d0 |
2816208 has 100 divisors (see below), whose sum is σ = 8507268. Its totient is φ = 898560.
The previous prime is 2816197. The next prime is 2816213. The reversal of 2816208 is 8026182.
2816208 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 944784 + 1871424 = 972^2 + 1368^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
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 19 ways as a sum of consecutive naturals, for example, 53110 + ... + 53162.
22816208 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 2816208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4253634).
2816208 is an abundant number, since it is smaller than the sum of its proper divisors (5691060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2816208 is a wasteful number, since it uses less digits than its factorization.
2816208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114 (or 99 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
The square root of 2816208 is about 1678.1561309962. The cubic root of 2816208 is about 141.2174101857.
The spelling of 2816208 in words is "two million, eight hundred sixteen thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •