Base | Representation |
---|---|
bin | 11110101110110010000 |
3 | 1220011100000 |
4 | 3311312100 |
5 | 224210432 |
6 | 33330000 |
7 | 11362560 |
oct | 3656620 |
9 | 1804300 |
10 | 1006992 |
11 | 628628 |
12 | 406900 |
13 | 29346c |
14 | 1c2da0 |
15 | 14d57c |
hex | f5d90 |
1006992 has 120 divisors (see below), whose sum is σ = 3430336. Its totient is φ = 279936.
The previous prime is 1006991. The next prime is 1007021. The reversal of 1006992 is 2996001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nialpdrome in base 6.
It is a zygodrome in base 6.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1006991) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 27198 + ... + 27234.
21006992 is an apocalyptic number.
1006992 is a gapful number since it is divisible by the number (12) 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 1006992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1715168).
1006992 is an abundant number, since it is smaller than the sum of its proper divisors (2423344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1006992 is an equidigital number, since it uses as much as digits as its factorization.
1006992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67 (or 49 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 27.
The square root of 1006992 is about 1003.4899102632. The cubic root of 1006992 is about 100.2325255662.
The spelling of 1006992 in words is "one million, six thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •