Base | Representation |
---|---|
bin | 1000010100001110000000 |
3 | 11002202100120 |
4 | 20110032000 |
5 | 1024224333 |
6 | 114420240 |
7 | 24346410 |
oct | 10241600 |
9 | 4082316 |
10 | 2179968 |
11 | 125992a |
12 | 891680 |
13 | 5b432b |
14 | 40a640 |
15 | 2d0db3 |
hex | 214380 |
2179968 has 64 divisors (see below), whose sum is σ = 6625920. Its totient is φ = 622080.
The previous prime is 2179967. The next prime is 2179981. The reversal of 2179968 is 8699712.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2179967) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2283 + ... + 3093.
It is an arithmetic number, because the mean of its divisors is an integer number (103530).
22179968 is an apocalyptic number.
2179968 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2179968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3312960).
2179968 is an abundant number, since it is smaller than the sum of its proper divisors (4445952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2179968 is an equidigital number, since it uses as much as digits as its factorization.
2179968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 835 (or 823 counting only the distinct ones).
The product of its digits is 54432, while the sum is 42.
The square root of 2179968 is about 1476.4714694162. The cubic root of 2179968 is about 129.6631912536.
The spelling of 2179968 in words is "two million, one hundred seventy-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •