Base | Representation |
---|---|
bin | 11101101000000… |
… | …101110111011101 |
3 | 1021122021201010012 |
4 | 131220011313131 |
5 | 2004221032203 |
6 | 121153253005 |
7 | 15213563414 |
oct | 3550056735 |
9 | 1248251105 |
10 | 497049053 |
11 | 235631346 |
12 | 11a564165 |
13 | 7bc90b87 |
14 | 4a02847b |
15 | 2d983bd8 |
hex | 1da05ddd |
497049053 has 2 divisors, whose sum is σ = 497049054. Its totient is φ = 497049052.
The previous prime is 497049023. The next prime is 497049073. The reversal of 497049053 is 350940794.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 472714564 + 24334489 = 21742^2 + 4933^2 .
It is a cyclic number.
It is not a de Polignac number, because 497049053 - 210 = 497048029 is a prime.
It is a super-2 number, since 2×4970490532 = 494115522176393618, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 497049053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (497049013) 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, 248524526 + 248524527.
It is an arithmetic number, because the mean of its divisors is an integer number (248524527).
Almost surely, 2497049053 is an apocalyptic number.
It is an amenable number.
497049053 is a deficient number, since it is larger than the sum of its proper divisors (1).
497049053 is an equidigital number, since it uses as much as digits as its factorization.
497049053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 136080, while the sum is 41.
The square root of 497049053 is about 22294.5969463455. The cubic root of 497049053 is about 792.1359985864.
The spelling of 497049053 in words is "four hundred ninety-seven million, forty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •