Search a number
-
+
485497 is a prime number
BaseRepresentation
bin1110110100001111001
3220122222101
41312201321
5111013442
614223401
74061305
oct1664171
9818871
10485497
11301841
121b4b61
1313cc9c
14c8d05
1598cb7
hex76879

485497 has 2 divisors, whose sum is σ = 485498. Its totient is φ = 485496.

The previous prime is 485479. The next prime is 485509. The reversal of 485497 is 794584.

Together with previous prime (485479) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 385641 + 99856 = 621^2 + 316^2 .

It is a cyclic number.

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

It is not a weakly prime, because it can be changed into another prime (485417) 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, 242748 + 242749.

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

2485497 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 40320, while the sum is 37.

The square root of 485497 is about 696.7761476974. The cubic root of 485497 is about 78.5951083291.

The spelling of 485497 in words is "four hundred eighty-five thousand, four hundred ninety-seven".