Base | Representation |
---|---|
bin | 10001001101110… |
… | …000110000011101 |
3 | 202010110120220102 |
4 | 101031300300131 |
5 | 1042414222003 |
6 | 44354230445 |
7 | 10104634361 |
oct | 2115606035 |
9 | 663416812 |
10 | 288820253 |
11 | 139038a27 |
12 | 80885425 |
13 | 47ab5277 |
14 | 2a5032a1 |
15 | 1a551588 |
hex | 11370c1d |
288820253 has 2 divisors, whose sum is σ = 288820254. Its totient is φ = 288820252.
The previous prime is 288820247. The next prime is 288820291. The reversal of 288820253 is 352028882.
It is an a-pointer prime, because the next prime (288820291) can be obtained adding 288820253 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 218980804 + 69839449 = 14798^2 + 8357^2 .
It is a cyclic number.
It is not a de Polignac number, because 288820253 - 210 = 288819229 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (288829253) 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 as a sum of consecutive naturals, namely, 144410126 + 144410127.
It is an arithmetic number, because the mean of its divisors is an integer number (144410127).
Almost surely, 2288820253 is an apocalyptic number.
It is an amenable number.
288820253 is a deficient number, since it is larger than the sum of its proper divisors (1).
288820253 is an equidigital number, since it uses as much as digits as its factorization.
288820253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61440, while the sum is 38.
The square root of 288820253 is about 16994.7125012458. The cubic root of 288820253 is about 661.0118036012.
The spelling of 288820253 in words is "two hundred eighty-eight million, eight hundred twenty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •