Search a number
-
+
495161 is a prime number
BaseRepresentation
bin1111000111000111001
3221011020022
41320320321
5111321121
614340225
74131422
oct1707071
9834208
10495161
11309027
121ba675
131444c4
14cc649
159baab
hex78e39

495161 has 2 divisors, whose sum is σ = 495162. Its totient is φ = 495160.

The previous prime is 495151. The next prime is 495181. The reversal of 495161 is 161594.

495161 is nontrivially palindromic in base 8.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 462400 + 32761 = 680^2 + 181^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-495161 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 495161.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 495161.

It is not a weakly prime, because it can be changed into another prime (495151) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 247580 + 247581.

It is an arithmetic number, because the mean of its divisors is an integer number (247581).

2495161 is an apocalyptic number.

It is an amenable number.

495161 is a deficient number, since it is larger than the sum of its proper divisors (1).

495161 is an equidigital number, since it uses as much as digits as its factorization.

495161 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 1080, while the sum is 26.

The square root of 495161 is about 703.6767723891. The cubic root of 495161 is about 79.1131743285.

It can be divided in two parts, 495 and 161, that added together give a palindrome (656).

The spelling of 495161 in words is "four hundred ninety-five thousand, one hundred sixty-one".