Base | Representation |
---|---|
bin | 11000011111101… |
… | …11001110001101 |
3 | 112022122201100101 |
4 | 30033313032031 |
5 | 410101004231 |
6 | 32220131101 |
7 | 5043410314 |
oct | 1417671615 |
9 | 468581311 |
10 | 205484941 |
11 | a5a99972 |
12 | 58996a91 |
13 | 33757a2c |
14 | 1d40d27b |
15 | 1308e661 |
hex | c3f738d |
205484941 has 2 divisors, whose sum is σ = 205484942. Its totient is φ = 205484940.
The previous prime is 205484821. The next prime is 205484953. The reversal of 205484941 is 149484502.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 186431716 + 19053225 = 13654^2 + 4365^2 .
It is a cyclic number.
It is not a de Polignac number, because 205484941 - 29 = 205484429 is a prime.
It is equal to p11365777 and since 205484941 and 11365777 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 205484941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (205484441) 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, 102742470 + 102742471.
It is an arithmetic number, because the mean of its divisors is an integer number (102742471).
Almost surely, 2205484941 is an apocalyptic number.
It is an amenable number.
205484941 is a deficient number, since it is larger than the sum of its proper divisors (1).
205484941 is an equidigital number, since it uses as much as digits as its factorization.
205484941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46080, while the sum is 37.
The square root of 205484941 is about 14334.7459342675. The cubic root of 205484941 is about 590.1014294641.
The spelling of 205484941 in words is "two hundred five million, four hundred eighty-four thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •