Base | Representation |
---|---|
bin | 10001001101111… |
… | …110000111111001 |
3 | 202010120101000010 |
4 | 101031332013321 |
5 | 1042423000001 |
6 | 44355332133 |
7 | 10105253112 |
oct | 2115760771 |
9 | 663511003 |
10 | 288875001 |
11 | 139076078 |
12 | 808b1049 |
13 | 47b0416c |
14 | 2a519209 |
15 | 1a5628d6 |
hex | 1137e1f9 |
288875001 has 4 divisors (see below), whose sum is σ = 385166672. Its totient is φ = 192583332.
The previous prime is 288874991. The next prime is 288875011. The reversal of 288875001 is 100578882.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (288874991) and next prime (288875011).
It is not a de Polignac number, because 288875001 - 25 = 288874969 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (288875011) 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 3 ways as a sum of consecutive naturals, for example, 48145831 + ... + 48145836.
It is an arithmetic number, because the mean of its divisors is an integer number (96291668).
Almost surely, 2288875001 is an apocalyptic number.
It is an amenable number.
288875001 is a deficient number, since it is larger than the sum of its proper divisors (96291671).
288875001 is an equidigital number, since it uses as much as digits as its factorization.
288875001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96291670.
The product of its (nonzero) digits is 35840, while the sum is 39.
The square root of 288875001 is about 16996.3231612017. The cubic root of 288875001 is about 661.0535675097.
The spelling of 288875001 in words is "two hundred eighty-eight million, eight hundred seventy-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •