Base | Representation |
---|---|
bin | 1000010001100010111… |
… | …11000010010111000000 |
3 | 1000011211012221220010000 |
4 | 10020301133002113000 |
5 | 14124220300424443 |
6 | 334334342040000 |
7 | 26353112435265 |
oct | 4106137022700 |
9 | 1004735856100 |
10 | 284298061248 |
11 | aa62a931313 |
12 | 47122a19000 |
13 | 20a69a44ba6 |
14 | da8d9db26c |
15 | 75dde428d3 |
hex | 42317c25c0 |
284298061248 has 140 divisors (see below), whose sum is σ = 849183739272. Its totient is φ = 94042391040.
The previous prime is 284298061241. The next prime is 284298061253. The reversal of 284298061248 is 842160892482.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 284298061194 and 284298061203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (284298061241) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 469786 + ... + 888422.
Almost surely, 2284298061248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 284298061248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (424591869636).
284298061248 is an abundant number, since it is smaller than the sum of its proper divisors (564885678024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
284298061248 is a wasteful number, since it uses less digits than its factorization.
284298061248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418792 (or 418773 counting only the distinct ones).
The product of its (nonzero) digits is 3538944, while the sum is 54.
The spelling of 284298061248 in words is "two hundred eighty-four billion, two hundred ninety-eight million, sixty-one thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •