Base | Representation |
---|---|
bin | 11000100001110… |
… | …10101000010001 |
3 | 112100011202002022 |
4 | 30100322220101 |
5 | 410133323131 |
6 | 32230101225 |
7 | 5045640263 |
oct | 1420725021 |
9 | 470152068 |
10 | 205761041 |
11 | a6168352 |
12 | 58aaa815 |
13 | 338235c5 |
14 | 1d481b33 |
15 | 130e637b |
hex | c43aa11 |
205761041 has 2 divisors, whose sum is σ = 205761042. Its totient is φ = 205761040.
The previous prime is 205761011. The next prime is 205761077. The reversal of 205761041 is 140167502.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198922816 + 6838225 = 14104^2 + 2615^2 .
It is a cyclic number.
It is not a de Polignac number, because 205761041 - 222 = 201566737 is a prime.
It is a Chen prime.
It is equal to p11380166 and since 205761041 and 11380166 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 205761041.
It is not a weakly prime, because it can be changed into another prime (205761011) 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, 102880520 + 102880521.
It is an arithmetic number, because the mean of its divisors is an integer number (102880521).
Almost surely, 2205761041 is an apocalyptic number.
It is an amenable number.
205761041 is a deficient number, since it is larger than the sum of its proper divisors (1).
205761041 is an equidigital number, since it uses as much as digits as its factorization.
205761041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 205761041 is about 14344.3731476841. The cubic root of 205761041 is about 590.3656079256.
The spelling of 205761041 in words is "two hundred five million, seven hundred sixty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •