Base | Representation |
---|---|
bin | 10001000100010… |
… | …001000000000000 |
3 | 201221210010010102 |
4 | 101010101000000 |
5 | 1041300042010 |
6 | 44225021532 |
7 | 10044525623 |
oct | 2104210000 |
9 | 657703112 |
10 | 286330880 |
11 | 1376986a0 |
12 | 7ba848a8 |
13 | 47423174 |
14 | 2a055dba |
15 | 1a20dba5 |
hex | 11111000 |
286330880 has 208 divisors, whose sum is σ = 792626688. Its totient is φ = 98304000.
The previous prime is 286330879. The next prime is 286330883. The reversal of 286330880 is 88033682.
It is a nialpdrome in base 16.
It is a zygodrome in base 16.
It is not an unprimeable number, because it can be changed into a prime (286330883) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6983660 + ... + 6983700.
Almost surely, 2286330880 is an apocalyptic number.
286330880 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 286330880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (396313344).
286330880 is an abundant number, since it is smaller than the sum of its proper divisors (506295808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
286330880 is a wasteful number, since it uses less digits than its factorization.
286330880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112 (or 90 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 38.
The square root of 286330880 is about 16921.3143697527. The cubic root of 286330880 is about 659.1072103661.
The spelling of 286330880 in words is "two hundred eighty-six million, three hundred thirty thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •