Base | Representation |
---|---|
bin | 1011111100101101101… |
… | …00000100000000110001 |
3 | 1110020201002020210002112 |
4 | 11332112310010000301 |
5 | 23211302320422231 |
6 | 512334404455105 |
7 | 41442602320205 |
oct | 5762664040061 |
9 | 1406632223075 |
10 | 410552123441 |
11 | 149128a74979 |
12 | 676990aa495 |
13 | 2c93a830675 |
14 | 15c297a8b05 |
15 | aa2ceb892b |
hex | 5f96d04031 |
410552123441 has 2 divisors, whose sum is σ = 410552123442. Its totient is φ = 410552123440.
The previous prime is 410552123381. The next prime is 410552123479. The reversal of 410552123441 is 144321255014.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 405254467216 + 5297656225 = 636596^2 + 72785^2 .
It is a cyclic number.
It is not a de Polignac number, because 410552123441 - 214 = 410552107057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 410552123398 and 410552123407.
It is not a weakly prime, because it can be changed into another prime (410552126441) 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, 205276061720 + 205276061721.
It is an arithmetic number, because the mean of its divisors is an integer number (205276061721).
Almost surely, 2410552123441 is an apocalyptic number.
It is an amenable number.
410552123441 is a deficient number, since it is larger than the sum of its proper divisors (1).
410552123441 is an equidigital number, since it uses as much as digits as its factorization.
410552123441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 410552123441 its reverse (144321255014), we get a palindrome (554873378455).
The spelling of 410552123441 in words is "four hundred ten billion, five hundred fifty-two million, one hundred twenty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •