Base | Representation |
---|---|
bin | 11000010110010… |
… | …00011011011001 |
3 | 112020022201001102 |
4 | 30023020123121 |
5 | 404241312242 |
6 | 32133401145 |
7 | 5030023406 |
oct | 1413103331 |
9 | 466281042 |
10 | 204244697 |
11 | a5322078 |
12 | 584991b5 |
13 | 33412367 |
14 | 1d1a92ad |
15 | 12de6e32 |
hex | c2c86d9 |
204244697 has 2 divisors, whose sum is σ = 204244698. Its totient is φ = 204244696.
The previous prime is 204244679. The next prime is 204244717. The reversal of 204244697 is 796442402.
Together with previous prime (204244679) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 168376576 + 35868121 = 12976^2 + 5989^2 .
It is a cyclic number.
It is not a de Polignac number, because 204244697 - 224 = 187467481 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 204244697.
It is not a weakly prime, because it can be changed into another prime (204244627) 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, 102122348 + 102122349.
It is an arithmetic number, because the mean of its divisors is an integer number (102122349).
Almost surely, 2204244697 is an apocalyptic number.
It is an amenable number.
204244697 is a deficient number, since it is larger than the sum of its proper divisors (1).
204244697 is an equidigital number, since it uses as much as digits as its factorization.
204244697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768, while the sum is 38.
The square root of 204244697 is about 14291.4203982669. The cubic root of 204244697 is about 588.9118091800.
The spelling of 204244697 in words is "two hundred four million, two hundred forty-four thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •