Base | Representation |
---|---|
bin | 10000110111011… |
… | …011110000000000 |
3 | 201201110012210202 |
4 | 100313123300000 |
5 | 1034414421130 |
6 | 44024544332 |
7 | 10004115536 |
oct | 2067336000 |
9 | 651405722 |
10 | 282967040 |
11 | 135800364 |
12 | 7a9220a8 |
13 | 46816025 |
14 | 2981c156 |
15 | 19c97145 |
hex | 10ddbc00 |
282967040 has 88 divisors (see below), whose sum is σ = 718939152. Its totient is φ = 106496000.
The previous prime is 282967033. The next prime is 282967051. The reversal of 282967040 is 40769282.
282967040 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 282966985 and 282967003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 85415 + ... + 88665.
Almost surely, 2282967040 is an apocalyptic number.
282967040 is a gapful number since it is divisible by the number (20) 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 282967040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (359469576).
282967040 is an abundant number, since it is smaller than the sum of its proper divisors (435972112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
282967040 is a wasteful number, since it uses less digits than its factorization.
282967040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3293 (or 3275 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 38.
The square root of 282967040 is about 16821.6241784199. The cubic root of 282967040 is about 656.5159533988.
The spelling of 282967040 in words is "two hundred eighty-two million, nine hundred sixty-seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •