Base | Representation |
---|---|
bin | 11101100000100… |
… | …011000011100101 |
3 | 1021111120020101001 |
4 | 131200203003211 |
5 | 2003214241321 |
6 | 121043033301 |
7 | 15161016013 |
oct | 3540430345 |
9 | 1244506331 |
10 | 495071461 |
11 | 234500575 |
12 | 11996b831 |
13 | 7b74a9c1 |
14 | 49a718b3 |
15 | 2d6e2c91 |
hex | 1d8230e5 |
495071461 has 2 divisors, whose sum is σ = 495071462. Its totient is φ = 495071460.
The previous prime is 495071449. The next prime is 495071471. The reversal of 495071461 is 164170594.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 281736225 + 213335236 = 16785^2 + 14606^2 .
It is a cyclic number.
It is not a de Polignac number, because 495071461 - 215 = 495038693 is a prime.
It is equal to p26109658 and since 495071461 and 26109658 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 495071461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (495071471) 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, 247535730 + 247535731.
It is an arithmetic number, because the mean of its divisors is an integer number (247535731).
Almost surely, 2495071461 is an apocalyptic number.
It is an amenable number.
495071461 is a deficient number, since it is larger than the sum of its proper divisors (1).
495071461 is an equidigital number, since it uses as much as digits as its factorization.
495071461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 37.
The square root of 495071461 is about 22250.2013698753. The cubic root of 495071461 is about 791.0840541394.
The spelling of 495071461 in words is "four hundred ninety-five million, seventy-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •