Base | Representation |
---|---|
bin | 11111011101010011100 |
3 | 1221101000020 |
4 | 3323222130 |
5 | 230441222 |
6 | 34032140 |
7 | 11522166 |
oct | 3735234 |
9 | 1841006 |
10 | 1030812 |
11 | 644512 |
12 | 418650 |
13 | 2a1263 |
14 | 1cb936 |
15 | 15565c |
hex | fba9c |
1030812 has 48 divisors (see below), whose sum is σ = 2644992. Its totient is φ = 311040.
The previous prime is 1030811. The next prime is 1030817. The reversal of 1030812 is 2180301.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1030791 and 1030800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6243 + ... + 6405.
It is an arithmetic number, because the mean of its divisors is an integer number (55104).
21030812 is an apocalyptic number.
1030812 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 1030812, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1322496).
1030812 is an abundant number, since it is smaller than the sum of its proper divisors (1614180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030812 is a wasteful number, since it uses less digits than its factorization.
1030812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218 (or 216 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1030812 is about 1015.2891213837. The cubic root of 1030812 is about 101.0166949496.
The spelling of 1030812 in words is "one million, thirty thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •