Base | Representation |
---|---|
bin | 11000100101001… |
… | …10111001001001 |
3 | 112101000021101022 |
4 | 30102212321021 |
5 | 410242020424 |
6 | 32243402225 |
7 | 5052465161 |
oct | 1422467111 |
9 | 471007338 |
10 | 206204489 |
11 | a6440537 |
12 | 59083375 |
13 | 3394a3ba |
14 | 1d5595a1 |
15 | 1318295e |
hex | c4a6e49 |
206204489 has 2 divisors, whose sum is σ = 206204490. Its totient is φ = 206204488.
The previous prime is 206204477. The next prime is 206204491. The reversal of 206204489 is 984402602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 174451264 + 31753225 = 13208^2 + 5635^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-206204489 is a prime.
It is a super-2 number, since 2×2062044892 = 85040582567502242, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 206204491, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (206204459) 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, 103102244 + 103102245.
It is an arithmetic number, because the mean of its divisors is an integer number (103102245).
Almost surely, 2206204489 is an apocalyptic number.
It is an amenable number.
206204489 is a deficient number, since it is larger than the sum of its proper divisors (1).
206204489 is an equidigital number, since it uses as much as digits as its factorization.
206204489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 35.
The square root of 206204489 is about 14359.8220392873. The cubic root of 206204489 is about 590.7894144289.
The spelling of 206204489 in words is "two hundred six million, two hundred four thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •