Base | Representation |
---|---|
bin | 10001000110110… |
… | …100100110101001 |
3 | 202000001011100201 |
4 | 101012310212221 |
5 | 1041433013001 |
6 | 44251232201 |
7 | 10053316420 |
oct | 2106644651 |
9 | 660034321 |
10 | 287001001 |
11 | 138006111 |
12 | 80148661 |
13 | 475c91a1 |
14 | 2a18c2b7 |
15 | 1a2e2501 |
hex | 111b49a9 |
287001001 has 8 divisors (see below), whose sum is σ = 328117824. Its totient is φ = 245913360.
The previous prime is 287000977. The next prime is 287001017. The reversal of 287001001 is 100100782.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 287001001 - 211 = 286998953 is a prime.
It is a Duffinian number.
287001001 is a modest number, since divided by 1001 gives 287 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 287001001.
It is not an unprimeable number, because it can be changed into a prime (287001101) 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 7 ways as a sum of consecutive naturals, for example, 21231 + ... + 32011.
It is an arithmetic number, because the mean of its divisors is an integer number (41014728).
Almost surely, 2287001001 is an apocalyptic number.
It is an amenable number.
287001001 is a deficient number, since it is larger than the sum of its proper divisors (41116823).
287001001 is a wasteful number, since it uses less digits than its factorization.
287001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14591.
The product of its (nonzero) digits is 112, while the sum is 19.
The square root of 287001001 is about 16941.1038896525. The cubic root of 287001001 is about 659.6209952848.
Adding to 287001001 its reverse (100100782), we get a palindrome (387101783).
The spelling of 287001001 in words is "two hundred eighty-seven million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •