Base | Representation |
---|---|
bin | 10001000101000… |
… | …100100111111010 |
3 | 201222011212011220 |
4 | 101011010213322 |
5 | 1041323323310 |
6 | 44233332510 |
7 | 10046366244 |
oct | 2105044772 |
9 | 658155156 |
10 | 286542330 |
11 | 137822548 |
12 | 7bb67136 |
13 | 47498499 |
14 | 2a0ad094 |
15 | 1a251670 |
hex | 111449fa |
286542330 has 64 divisors (see below), whose sum is σ = 714130560. Its totient is φ = 73495296.
The previous prime is 286542329. The next prime is 286542337. The reversal of 286542330 is 33245682.
It is a happy number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 286542291 and 286542300.
It is not an unprimeable number, because it can be changed into a prime (286542337) 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 31 ways as a sum of consecutive naturals, for example, 324069 + ... + 324951.
It is an arithmetic number, because the mean of its divisors is an integer number (11158290).
Almost surely, 2286542330 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 286542330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (357065280).
286542330 is an abundant number, since it is smaller than the sum of its proper divisors (427588230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
286542330 is a wasteful number, since it uses less digits than its factorization.
286542330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1295.
The product of its (nonzero) digits is 34560, while the sum is 33.
The square root of 286542330 is about 16927.5612537660. The cubic root of 286542330 is about 659.2694165600.
The spelling of 286542330 in words is "two hundred eighty-six million, five hundred forty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •