Base | Representation |
---|---|
bin | 11101001100001… |
… | …000101001110001 |
3 | 1021010111101010211 |
4 | 131030020221301 |
5 | 2000332023213 |
6 | 120332224121 |
7 | 15064361236 |
oct | 3514105161 |
9 | 1233441124 |
10 | 489720433 |
11 | 231486234 |
12 | 11800b041 |
13 | 7a5c6207 |
14 | 4907b78d |
15 | 2ced753d |
hex | 1d308a71 |
489720433 has 2 divisors, whose sum is σ = 489720434. Its totient is φ = 489720432.
The previous prime is 489720391. The next prime is 489720437. The reversal of 489720433 is 334027984.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 437981184 + 51739249 = 20928^2 + 7193^2 .
It is a cyclic number.
It is not a de Polignac number, because 489720433 - 29 = 489719921 is a prime.
It is a super-2 number, since 2×4897204332 = 479652204995414978, which contains 22 as substring.
It is equal to p25842298 and since 489720433 and 25842298 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 (489720437) 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, 244860216 + 244860217.
It is an arithmetic number, because the mean of its divisors is an integer number (244860217).
Almost surely, 2489720433 is an apocalyptic number.
It is an amenable number.
489720433 is a deficient number, since it is larger than the sum of its proper divisors (1).
489720433 is an equidigital number, since it uses as much as digits as its factorization.
489720433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145152, while the sum is 40.
The square root of 489720433 is about 22129.6279453587. The cubic root of 489720433 is about 788.2235536243.
The spelling of 489720433 in words is "four hundred eighty-nine million, seven hundred twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •