Base | Representation |
---|---|
bin | 1000011000001010001100 |
3 | 11010120111100 |
4 | 20120022030 |
5 | 1030233413 |
6 | 115023100 |
7 | 24444435 |
oct | 10301214 |
9 | 4116440 |
10 | 2196108 |
11 | 126aa72 |
12 | 89aa90 |
13 | 5bb795 |
14 | 41248c |
15 | 2d5a73 |
hex | 21828c |
2196108 has 36 divisors (see below), whose sum is σ = 5660928. Its totient is φ = 717600.
The previous prime is 2196107. The next prime is 2196113. The reversal of 2196108 is 8016912.
It is a tau number, because it is divible by the number of its divisors (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2196107) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 1333 + ... + 2483.
It is an arithmetic number, because the mean of its divisors is an integer number (157248).
22196108 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 2196108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2830464).
2196108 is an abundant number, since it is smaller than the sum of its proper divisors (3464820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2196108 is a wasteful number, since it uses less digits than its factorization.
2196108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1214 (or 1209 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The square root of 2196108 is about 1481.9271237143. The cubic root of 2196108 is about 129.9824039300.
It can be divided in two parts, 2196 and 108, that added together give a square (2304 = 482).
The spelling of 2196108 in words is "two million, one hundred ninety-six thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •