Base | Representation |
---|---|
bin | 11000011100010… |
… | …10010111010101 |
3 | 112021211001201022 |
4 | 30032022113111 |
5 | 404442222221 |
6 | 32202410525 |
7 | 5036542343 |
oct | 1416122725 |
9 | 467731638 |
10 | 205039061 |
11 | a5814977 |
12 | 58800a45 |
13 | 3362cab6 |
14 | 1d334993 |
15 | 130024ab |
hex | c38a5d5 |
205039061 has 2 divisors, whose sum is σ = 205039062. Its totient is φ = 205039060.
The previous prime is 205038947. The next prime is 205039067. The reversal of 205039061 is 160930502.
205039061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 193376836 + 11662225 = 13906^2 + 3415^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-205039061 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 205039061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (205039067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102519530 + 102519531.
It is an arithmetic number, because the mean of its divisors is an integer number (102519531).
Almost surely, 2205039061 is an apocalyptic number.
It is an amenable number.
205039061 is a deficient number, since it is larger than the sum of its proper divisors (1).
205039061 is an equidigital number, since it uses as much as digits as its factorization.
205039061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 205039061 is about 14319.1850675938. The cubic root of 205039061 is about 589.6743017084.
Adding to 205039061 its reverse (160930502), we get a palindrome (365969563).
The spelling of 205039061 in words is "two hundred five million, thirty-nine thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •