Base | Representation |
---|---|
bin | 11101010000111… |
… | …100000011010001 |
3 | 1021012212100022022 |
4 | 131100330003101 |
5 | 2001142321122 |
6 | 120415221225 |
7 | 15111154136 |
oct | 3520740321 |
9 | 1235770268 |
10 | 490979537 |
11 | 232166214 |
12 | 118517815 |
13 | 7a947349 |
14 | 492c858d |
15 | 2d185642 |
hex | 1d43c0d1 |
490979537 has 2 divisors, whose sum is σ = 490979538. Its totient is φ = 490979536.
The previous prime is 490979509. The next prime is 490979539. The reversal of 490979537 is 735979094.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 439153936 + 51825601 = 20956^2 + 7199^2 .
It is a cyclic number.
It is not a de Polignac number, because 490979537 - 228 = 222544081 is a prime.
Together with 490979539, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (490979539) 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, 245489768 + 245489769.
It is an arithmetic number, because the mean of its divisors is an integer number (245489769).
Almost surely, 2490979537 is an apocalyptic number.
It is an amenable number.
490979537 is a deficient number, since it is larger than the sum of its proper divisors (1).
490979537 is an equidigital number, since it uses as much as digits as its factorization.
490979537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2143260, while the sum is 53.
The square root of 490979537 is about 22158.0580602182. The cubic root of 490979537 is about 788.8985006749.
The spelling of 490979537 in words is "four hundred ninety million, nine hundred seventy-nine thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.313 sec. • engine limits •