Base | Representation |
---|---|
bin | 11101000010011… |
… | …110111110111101 |
3 | 1020221201211200011 |
4 | 131002132332331 |
5 | 1444210043321 |
6 | 120202103221 |
7 | 15034023232 |
oct | 3502367675 |
9 | 1227654604 |
10 | 487190461 |
11 | 23000844a |
12 | 1171aab11 |
13 | 79c1b7a4 |
14 | 489bd789 |
15 | 2cb87ae1 |
hex | 1d09efbd |
487190461 has 2 divisors, whose sum is σ = 487190462. Its totient is φ = 487190460.
The previous prime is 487190423. The next prime is 487190467. The reversal of 487190461 is 164091784.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 471150436 + 16040025 = 21706^2 + 4005^2 .
It is a cyclic number.
It is not a de Polignac number, because 487190461 - 211 = 487188413 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (487190467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 243595230 + 243595231.
It is an arithmetic number, because the mean of its divisors is an integer number (243595231).
Almost surely, 2487190461 is an apocalyptic number.
It is an amenable number.
487190461 is a deficient number, since it is larger than the sum of its proper divisors (1).
487190461 is an equidigital number, since it uses as much as digits as its factorization.
487190461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384, while the sum is 40.
The square root of 487190461 is about 22072.3913747469. The cubic root of 487190461 is about 786.8638475801.
The spelling of 487190461 in words is "four hundred eighty-seven million, one hundred ninety thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •