Base | Representation |
---|---|
bin | 11101001011110… |
… | …101111000010101 |
3 | 1021010100110122222 |
4 | 131023311320111 |
5 | 2000322043131 |
6 | 120330432125 |
7 | 15063621122 |
oct | 3513657025 |
9 | 1233313588 |
10 | 489643541 |
11 | 231433492 |
12 | 117b92645 |
13 | 7a59a20a |
14 | 4905b749 |
15 | 2cebe87b |
hex | 1d2f5e15 |
489643541 has 2 divisors, whose sum is σ = 489643542. Its totient is φ = 489643540.
The previous prime is 489643519. The next prime is 489643549. The reversal of 489643541 is 145346984.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 280696516 + 208947025 = 16754^2 + 14455^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-489643541 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 489643492 and 489643501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (489643549) 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, 244821770 + 244821771.
It is an arithmetic number, because the mean of its divisors is an integer number (244821771).
Almost surely, 2489643541 is an apocalyptic number.
It is an amenable number.
489643541 is a deficient number, since it is larger than the sum of its proper divisors (1).
489643541 is an equidigital number, since it uses as much as digits as its factorization.
489643541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 414720, while the sum is 44.
The square root of 489643541 is about 22127.8905682399. The cubic root of 489643541 is about 788.1822979379.
The spelling of 489643541 in words is "four hundred eighty-nine million, six hundred forty-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •