Base | Representation |
---|---|
bin | 10001000111110… |
… | …111101101101001 |
3 | 202000120010102110 |
4 | 101013313231221 |
5 | 1042020312011 |
6 | 44301152533 |
7 | 10055543004 |
oct | 2107675551 |
9 | 660503373 |
10 | 287275881 |
11 | 138183692 |
12 | 8025b749 |
13 | 47694339 |
14 | 2a22053b |
15 | 1a348ba6 |
hex | 111f7b69 |
287275881 has 8 divisors (see below), whose sum is σ = 393386944. Its totient is φ = 186341040.
The previous prime is 287275873. The next prime is 287275883. The reversal of 287275881 is 188572782.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 287275881 - 23 = 287275873 is a prime.
It is a super-2 number, since 2×2872758812 = 165054863608652322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 287275881.
It is not an unprimeable number, because it can be changed into a prime (287275883) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1293925 + ... + 1294146.
It is an arithmetic number, because the mean of its divisors is an integer number (49173368).
Almost surely, 2287275881 is an apocalyptic number.
It is an amenable number.
287275881 is a deficient number, since it is larger than the sum of its proper divisors (106111063).
287275881 is a wasteful number, since it uses less digits than its factorization.
287275881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2588111.
The product of its digits is 501760, while the sum is 48.
The square root of 287275881 is about 16949.2147605722. The cubic root of 287275881 is about 659.8315157627.
The spelling of 287275881 in words is "two hundred eighty-seven million, two hundred seventy-five thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •