Base | Representation |
---|---|
bin | 11101100011000… |
… | …110001000110001 |
3 | 1021112211011200001 |
4 | 131203012020301 |
5 | 2003402130231 |
6 | 121105230001 |
7 | 15166500331 |
oct | 3543061061 |
9 | 1245734601 |
10 | 495739441 |
11 | 23491741a |
12 | 11a032301 |
13 | 7b922a62 |
14 | 49ba70c1 |
15 | 2d7c5b61 |
hex | 1d8c6231 |
495739441 has 2 divisors, whose sum is σ = 495739442. Its totient is φ = 495739440.
The previous prime is 495739351. The next prime is 495739459. The reversal of 495739441 is 144937594.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 495730225 + 9216 = 22265^2 + 96^2 .
It is a cyclic number.
It is not a de Polignac number, because 495739441 - 211 = 495737393 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 495739391 and 495739400.
It is not a weakly prime, because it can be changed into another prime (495730441) 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, 247869720 + 247869721.
It is an arithmetic number, because the mean of its divisors is an integer number (247869721).
Almost surely, 2495739441 is an apocalyptic number.
It is an amenable number.
495739441 is a deficient number, since it is larger than the sum of its proper divisors (1).
495739441 is an equidigital number, since it uses as much as digits as its factorization.
495739441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 544320, while the sum is 46.
The square root of 495739441 is about 22265.2069606370. The cubic root of 495739441 is about 791.4396868670.
It can be divided in two parts, 495 and 739441, that added together give a triangular number (739936 = T1216).
The spelling of 495739441 in words is "four hundred ninety-five million, seven hundred thirty-nine thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •