Base | Representation |
---|---|
bin | 100001000001110001010 |
3 | 2000222120100 |
4 | 10020032022 |
5 | 234113000 |
6 | 35110230 |
7 | 12125151 |
oct | 4101612 |
9 | 2028510 |
10 | 1082250 |
11 | 67a124 |
12 | 442376 |
13 | 2bb7b0 |
14 | 202598 |
15 | 165a00 |
hex | 10838a |
1082250 has 96 divisors (see below), whose sum is σ = 3236688. Its totient is φ = 259200.
The previous prime is 1082243. The next prime is 1082273. The reversal of 1082250 is 522801.
It can be written as a sum of positive squares in 8 ways, for example, as 47961 + 1034289 = 219^2 + 1017^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 29232 + ... + 29268.
21082250 is an apocalyptic number.
1082250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1082250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1618344).
1082250 is an abundant number, since it is smaller than the sum of its proper divisors (2154438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1082250 is a wasteful number, since it uses less digits than its factorization.
It is an anagram of its base 9 representation: 1082250 = (2028510)9.
1082250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73 (or 60 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 1082250 is about 1040.3124530640. The cubic root of 1082250 is about 102.6697563771.
The spelling of 1082250 in words is "one million, eighty-two thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •