Base | Representation |
---|---|
bin | 100000010010000010100 |
3 | 1222202001020 |
4 | 10002100110 |
5 | 232322222 |
6 | 34401140 |
7 | 11664000 |
oct | 4022024 |
9 | 1882036 |
10 | 1057812 |
11 | 662828 |
12 | 4301b0 |
13 | 2b0632 |
14 | 1d7700 |
15 | 15d65c |
hex | 102414 |
1057812 has 48 divisors (see below), whose sum is σ = 2889600. Its totient is φ = 301056.
The previous prime is 1057807. The next prime is 1057831. The reversal of 1057812 is 2187501.
It is a super-2 number, since 2×10578122 = 2237932454688, which contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 3988 + ... + 4244.
It is an arithmetic number, because the mean of its divisors is an integer number (60200).
21057812 is an apocalyptic number.
1057812 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is a pronic number, being equal to 1028×1029.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1057812, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1444800).
1057812 is an abundant number, since it is smaller than the sum of its proper divisors (1831788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1057812 is a wasteful number, since it uses less digits than its factorization.
1057812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285 (or 269 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 24.
The square root of 1057812 is about 1028.4998784638. The cubic root of 1057812 is about 101.8910794247.
The spelling of 1057812 in words is "one million, fifty-seven thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •