Base | Representation |
---|---|
bin | 100000010000010101110 |
3 | 1222200212000 |
4 | 10002002232 |
5 | 232310232 |
6 | 34353130 |
7 | 11661315 |
oct | 4020256 |
9 | 1880760 |
10 | 1056942 |
11 | 662107 |
12 | 42b7a6 |
13 | 2b0113 |
14 | 1d727c |
15 | 15d27c |
hex | 1020ae |
1056942 has 48 divisors (see below), whose sum is σ = 2521680. Its totient is φ = 327888.
The previous prime is 1056929. The next prime is 1056949. The reversal of 1056942 is 2496501.
It is a super-2 number, since 2×10569422 = 2234252782728, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056949) 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 23 ways as a sum of consecutive naturals, for example, 28548 + ... + 28584.
It is an arithmetic number, because the mean of its divisors is an integer number (52535).
21056942 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1056942, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1260840).
1056942 is an abundant number, since it is smaller than the sum of its proper divisors (1464738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056942 is a wasteful number, since it uses less digits than its factorization.
1056942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94 (or 65 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 1056942 is about 1028.0768453768. The cubic root of 1056942 is about 101.8631382428.
The spelling of 1056942 in words is "one million, fifty-six thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •