Base | Representation |
---|---|
bin | 100001011101111011100 |
3 | 2001201100100 |
4 | 10023233130 |
5 | 240043133 |
6 | 35301100 |
7 | 12215166 |
oct | 4135734 |
9 | 2051310 |
10 | 1096668 |
11 | 689a41 |
12 | 44a790 |
13 | 2c5221 |
14 | 207936 |
15 | 169e13 |
hex | 10bbdc |
1096668 has 36 divisors (see below), whose sum is σ = 2843568. Its totient is φ = 356160.
The previous prime is 1096639. The next prime is 1096673. The reversal of 1096668 is 8666901.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1105 + ... + 1847.
It is an arithmetic number, because the mean of its divisors is an integer number (78988).
21096668 is an apocalyptic number.
1096668 is a gapful number since it is divisible by the number (18) 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 1096668, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1421784).
1096668 is an abundant number, since it is smaller than the sum of its proper divisors (1746900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1096668 is a wasteful number, since it uses less digits than its factorization.
1096668 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 794 (or 789 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 1096668 is about 1047.2191747672. The cubic root of 1096668 is about 103.1236771180.
It can be divided in two parts, 1096 and 668, that added together give a square (1764 = 422).
The spelling of 1096668 in words is "one million, ninety-six thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •