Base | Representation |
---|---|
bin | 11000100100110… |
… | …00011000100101 |
3 | 112100220020212021 |
4 | 30102120120211 |
5 | 410233120221 |
6 | 32242223141 |
7 | 5052130003 |
oct | 1422303045 |
9 | 470806767 |
10 | 206145061 |
11 | a63aa921 |
12 | 59054ab1 |
13 | 33929335 |
14 | 1d541a73 |
15 | 13170041 |
hex | c498625 |
206145061 has 4 divisors (see below), whose sum is σ = 206413900. Its totient is φ = 205876224.
The previous prime is 206145059. The next prime is 206145083. The reversal of 206145061 is 160541602.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 143640225 + 62504836 = 11985^2 + 7906^2 .
It is a cyclic number.
It is not a de Polignac number, because 206145061 - 21 = 206145059 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206145031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 133266 + ... + 134803.
It is an arithmetic number, because the mean of its divisors is an integer number (51603475).
Almost surely, 2206145061 is an apocalyptic number.
It is an amenable number.
206145061 is a deficient number, since it is larger than the sum of its proper divisors (268839).
206145061 is an equidigital number, since it uses as much as digits as its factorization.
206145061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268838.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 206145061 is about 14357.7526444775. The cubic root of 206145061 is about 590.7326539337.
Adding to 206145061 its reverse (160541602), we get a palindrome (366686663).
The spelling of 206145061 in words is "two hundred six million, one hundred forty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •