Base | Representation |
---|---|
bin | 10001001110000… |
… | …010011011101010 |
3 | 202010121021012210 |
4 | 101032002123222 |
5 | 1042424031100 |
6 | 44355545550 |
7 | 10105355424 |
oct | 2116023352 |
9 | 663537183 |
10 | 288892650 |
11 | 139088362 |
12 | 808bb2b6 |
13 | 47b0c1c7 |
14 | 2a521814 |
15 | 1a567c50 |
hex | 113826ea |
288892650 has 48 divisors (see below), whose sum is σ = 747612864. Its totient is φ = 73687680.
The previous prime is 288892631. The next prime is 288892661. The reversal of 288892650 is 56298882.
288892650 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 288892650.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 38419 + ... + 45318.
It is an arithmetic number, because the mean of its divisors is an integer number (15575268).
Almost surely, 2288892650 is an apocalyptic number.
288892650 is an abundant number, since it is smaller than the sum of its proper divisors (458720214).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
288892650 is a wasteful number, since it uses less digits than its factorization.
288892650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83775 (or 83770 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 48.
The square root of 288892650 is about 16996.8423538021. The cubic root of 288892650 is about 661.0670297301.
The spelling of 288892650 in words is "two hundred eighty-eight million, eight hundred ninety-two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •