Base | Representation |
---|---|
bin | 100000010000011100000 |
3 | 1222200220212 |
4 | 10002003200 |
5 | 232310432 |
6 | 34353252 |
7 | 11661416 |
oct | 4020340 |
9 | 1880825 |
10 | 1056992 |
11 | 662152 |
12 | 42b828 |
13 | 2b0151 |
14 | 1d72b6 |
15 | 15d2b2 |
hex | 1020e0 |
1056992 has 48 divisors (see below), whose sum is σ = 2313360. Its totient is φ = 473088.
The previous prime is 1056971. The next prime is 1057003. The reversal of 1056992 is 2996501.
It is a super-2 number, since 2×10569922 = 2234464176128, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15743 + ... + 15809.
It is an arithmetic number, because the mean of its divisors is an integer number (48195).
21056992 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 1056992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1156680).
1056992 is an abundant number, since it is smaller than the sum of its proper divisors (1256368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056992 is a wasteful number, since it uses less digits than its factorization.
1056992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123 (or 115 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 32.
The square root of 1056992 is about 1028.1011623376. The cubic root of 1056992 is about 101.8647444730.
It can be divided in two parts, 1056 and 992, that added together give a 11-th power (2048 = 211).
The spelling of 1056992 in words is "one million, fifty-six thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •