Base | Representation |
---|---|
bin | 11000100000101… |
… | …10010011010001 |
3 | 112022220011222012 |
4 | 30100112103101 |
5 | 410114042431 |
6 | 32222552305 |
7 | 5044450412 |
oct | 1420262321 |
9 | 468804865 |
10 | 205612241 |
11 | a607657a |
12 | 58a38695 |
13 | 337a0963 |
14 | 1d443809 |
15 | 130b722b |
hex | c4164d1 |
205612241 has 2 divisors, whose sum is σ = 205612242. Its totient is φ = 205612240.
The previous prime is 205612207. The next prime is 205612247. The reversal of 205612241 is 142216502.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113529025 + 92083216 = 10655^2 + 9596^2 .
It is a cyclic number.
It is not a de Polignac number, because 205612241 - 26 = 205612177 is a prime.
It is a super-3 number, since 3×2056122413 (a number of 26 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (205612247) 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 as a sum of consecutive naturals, namely, 102806120 + 102806121.
It is an arithmetic number, because the mean of its divisors is an integer number (102806121).
Almost surely, 2205612241 is an apocalyptic number.
It is an amenable number.
205612241 is a deficient number, since it is larger than the sum of its proper divisors (1).
205612241 is an equidigital number, since it uses as much as digits as its factorization.
205612241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 205612241 is about 14339.1855068550. The cubic root of 205612241 is about 590.2232622440.
Adding to 205612241 its reverse (142216502), we get a palindrome (347828743).
The spelling of 205612241 in words is "two hundred five million, six hundred twelve thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •