Base | Representation |
---|---|
bin | 11000011000010… |
… | …110100000111101 |
3 | 1001111200020002101 |
4 | 120120112200331 |
5 | 1314203134421 |
6 | 104331025101 |
7 | 13064520202 |
oct | 3030264075 |
9 | 1044606071 |
10 | 409036861 |
11 | 19a9884a2 |
12 | b4b9b191 |
13 | 6698695c |
14 | 3c477ca9 |
15 | 25d9b191 |
hex | 1861683d |
409036861 has 2 divisors, whose sum is σ = 409036862. Its totient is φ = 409036860.
The previous prime is 409036819. The next prime is 409036867. The reversal of 409036861 is 168630904.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 338376025 + 70660836 = 18395^2 + 8406^2 .
It is a cyclic number.
It is not a de Polignac number, because 409036861 - 227 = 274819133 is a prime.
It is a super-2 number, since 2×4090368612 = 334622307313466642, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 409036861.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (409036867) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 204518430 + 204518431.
It is an arithmetic number, because the mean of its divisors is an integer number (204518431).
Almost surely, 2409036861 is an apocalyptic number.
It is an amenable number.
409036861 is a deficient number, since it is larger than the sum of its proper divisors (1).
409036861 is an equidigital number, since it uses as much as digits as its factorization.
409036861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 37.
The square root of 409036861 is about 20224.6597251969. The cubic root of 409036861 is about 742.3137109693.
The spelling of 409036861 in words is "four hundred nine million, thirty-six thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •