Base | Representation |
---|---|
bin | 11100111010001… |
… | …110011101101001 |
3 | 1020210122212002122 |
4 | 130322032131221 |
5 | 1443131310031 |
6 | 120043441025 |
7 | 15006435632 |
oct | 3472163551 |
9 | 1223585078 |
10 | 485025641 |
11 | 229869a41 |
12 | 116526175 |
13 | 79641329 |
14 | 485b8889 |
15 | 2c8ab47b |
hex | 1ce8e769 |
485025641 has 2 divisors, whose sum is σ = 485025642. Its totient is φ = 485025640.
The previous prime is 485025599. The next prime is 485025647. The reversal of 485025641 is 146520584.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 282105616 + 202920025 = 16796^2 + 14245^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-485025641 is a prime.
It is a Chen prime.
485025641 is a modest number, since divided by 25641 gives 485 as remainder.
It is equal to p25607663 and since 485025641 and 25607663 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (485025647) 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, 242512820 + 242512821.
It is an arithmetic number, because the mean of its divisors is an integer number (242512821).
Almost surely, 2485025641 is an apocalyptic number.
It is an amenable number.
485025641 is a deficient number, since it is larger than the sum of its proper divisors (1).
485025641 is an equidigital number, since it uses as much as digits as its factorization.
485025641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38400, while the sum is 35.
The square root of 485025641 is about 22023.2976867680. The cubic root of 485025641 is about 785.6966463777.
The spelling of 485025641 in words is "four hundred eighty-five million, twenty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •