Base | Representation |
---|---|
bin | 11101001001111… |
… | …000010010001001 |
3 | 1021002101022222111 |
4 | 131021320102021 |
5 | 2000204112342 |
6 | 120311422321 |
7 | 15056346232 |
oct | 3511702211 |
9 | 1232338874 |
10 | 489129097 |
11 | 231111a26 |
12 | 1179849a1 |
13 | 7a44a002 |
14 | 48d66089 |
15 | 2ce1c217 |
hex | 1d278489 |
489129097 has 2 divisors, whose sum is σ = 489129098. Its totient is φ = 489129096.
The previous prime is 489129079. The next prime is 489129101. The reversal of 489129097 is 790921984.
Together with previous prime (489129079) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 470716416 + 18412681 = 21696^2 + 4291^2 .
It is a cyclic number.
It is not a de Polignac number, because 489129097 - 211 = 489127049 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 489129097.
It is not a weakly prime, because it can be changed into another prime (489129037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 244564548 + 244564549.
It is an arithmetic number, because the mean of its divisors is an integer number (244564549).
Almost surely, 2489129097 is an apocalyptic number.
It is an amenable number.
489129097 is a deficient number, since it is larger than the sum of its proper divisors (1).
489129097 is an equidigital number, since it uses as much as digits as its factorization.
489129097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 326592, while the sum is 49.
The square root of 489129097 is about 22116.2631789369. The cubic root of 489129097 is about 787.9061666251.
The spelling of 489129097 in words is "four hundred eighty-nine million, one hundred twenty-nine thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •