Base | Representation |
---|---|
bin | 11100111100100… |
… | …110010010111101 |
3 | 1020211211110012021 |
4 | 130330212102331 |
5 | 1443311210144 |
6 | 120105040141 |
7 | 15014636032 |
oct | 3474462275 |
9 | 1224743167 |
10 | 485647549 |
11 | 22a154212 |
12 | 116786051 |
13 | 797cb41a |
14 | 486db389 |
15 | 2c980884 |
hex | 1cf264bd |
485647549 has 2 divisors, whose sum is σ = 485647550. Its totient is φ = 485647548.
The previous prime is 485647537. The next prime is 485647567. The reversal of 485647549 is 945746584.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 385847449 + 99800100 = 19643^2 + 9990^2 .
It is a cyclic number.
It is not a de Polignac number, because 485647549 - 223 = 477258941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 485647496 and 485647505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (485647249) 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, 242823774 + 242823775.
It is an arithmetic number, because the mean of its divisors is an integer number (242823775).
Almost surely, 2485647549 is an apocalyptic number.
It is an amenable number.
485647549 is a deficient number, since it is larger than the sum of its proper divisors (1).
485647549 is an equidigital number, since it uses as much as digits as its factorization.
485647549 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4838400, while the sum is 52.
The square root of 485647549 is about 22037.4124842278. The cubic root of 485647549 is about 786.0323140852.
The spelling of 485647549 in words is "four hundred eighty-five million, six hundred forty-seven thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •