Base | Representation |
---|---|
bin | 10001000110011… |
… | …000110010001001 |
3 | 201222211101001021 |
4 | 101012120302021 |
5 | 1041420341144 |
6 | 44244552441 |
7 | 10052333251 |
oct | 2106306211 |
9 | 658741037 |
10 | 286887049 |
11 | 137a38539 |
12 | 800b2721 |
13 | 47589367 |
14 | 2a15c961 |
15 | 1a2bd884 |
hex | 11198c89 |
286887049 has 4 divisors (see below), whose sum is σ = 286960660. Its totient is φ = 286813440.
The previous prime is 286887043. The next prime is 286887067. The reversal of 286887049 is 940788682.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 141443449 + 145443600 = 11893^2 + 12060^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-286887049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 286886987 and 286887005.
It is not an unprimeable number, because it can be changed into a prime (286887043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30612 + ... + 38869.
It is an arithmetic number, because the mean of its divisors is an integer number (71740165).
Almost surely, 2286887049 is an apocalyptic number.
It is an amenable number.
286887049 is a deficient number, since it is larger than the sum of its proper divisors (73611).
286887049 is an equidigital number, since it uses as much as digits as its factorization.
286887049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73610.
The product of its (nonzero) digits is 1548288, while the sum is 52.
The square root of 286887049 is about 16937.7403746781. The cubic root of 286887049 is about 659.5336842284.
The spelling of 286887049 in words is "two hundred eighty-six million, eight hundred eighty-seven thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •