Base | Representation |
---|---|
bin | 11000010110010… |
… | …00011000111101 |
3 | 112020022200211122 |
4 | 30023020120331 |
5 | 404241311131 |
6 | 32133400325 |
7 | 5030023064 |
oct | 1413103075 |
9 | 466280748 |
10 | 204244541 |
11 | a5321a46 |
12 | 584990a5 |
13 | 33412277 |
14 | 1d1a91db |
15 | 12de6d7b |
hex | c2c863d |
204244541 has 2 divisors, whose sum is σ = 204244542. Its totient is φ = 204244540.
The previous prime is 204244519. The next prime is 204244553. The reversal of 204244541 is 145442402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144120025 + 60124516 = 12005^2 + 7754^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-204244541 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 204244541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (204244501) 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, 102122270 + 102122271.
It is an arithmetic number, because the mean of its divisors is an integer number (102122271).
Almost surely, 2204244541 is an apocalyptic number.
It is an amenable number.
204244541 is a deficient number, since it is larger than the sum of its proper divisors (1).
204244541 is an equidigital number, since it uses as much as digits as its factorization.
204244541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5120, while the sum is 26.
The square root of 204244541 is about 14291.4149404459. The cubic root of 204244541 is about 588.9116592451.
Adding to 204244541 its reverse (145442402), we get a palindrome (349686943).
The spelling of 204244541 in words is "two hundred four million, two hundred forty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •