Base | Representation |
---|---|
bin | 11000011101101… |
… | …11110001111001 |
3 | 112022011111212221 |
4 | 30032313301321 |
5 | 410014200311 |
6 | 32210404041 |
7 | 5041245565 |
oct | 1416676171 |
9 | 468144787 |
10 | 205225081 |
11 | a5931706 |
12 | 58890621 |
13 | 33696679 |
14 | 1d3826a5 |
15 | 1303c671 |
hex | c3b7c79 |
205225081 has 2 divisors, whose sum is σ = 205225082. Its totient is φ = 205225080.
The previous prime is 205225079. The next prime is 205225093. The reversal of 205225081 is 180522502.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 148840000 + 56385081 = 12200^2 + 7509^2 .
It is a cyclic number.
It is not a de Polignac number, because 205225081 - 21 = 205225079 is a prime.
It is a super-2 number, since 2×2052250812 = 84234667742913122, which contains 22 as substring.
Together with 205225079, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (205225981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102612540 + 102612541.
It is an arithmetic number, because the mean of its divisors is an integer number (102612541).
Almost surely, 2205225081 is an apocalyptic number.
It is an amenable number.
205225081 is a deficient number, since it is larger than the sum of its proper divisors (1).
205225081 is an equidigital number, since it uses as much as digits as its factorization.
205225081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1600, while the sum is 25.
The square root of 205225081 is about 14325.6790763998. The cubic root of 205225081 is about 589.8525735258.
Adding to 205225081 its reverse (180522502), we get a palindrome (385747583).
The spelling of 205225081 in words is "two hundred five million, two hundred twenty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •