Search a number
-
+
485701 is a prime number
BaseRepresentation
bin1110110100101000101
3220200020221
41312211011
5111020301
614224341
74062016
oct1664505
9820227
10485701
11301a07
121b50b1
131400c8
14c900d
1598da1
hex76945

485701 has 2 divisors, whose sum is σ = 485702. Its totient is φ = 485700.

The previous prime is 485689. The next prime is 485717. The reversal of 485701 is 107584.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 324900 + 160801 = 570^2 + 401^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×4857012 = 471810922802, which contains 22 as substring.

It is a congruent number.

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

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

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

2485701 is an apocalyptic number.

It is an amenable number.

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

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

485701 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1120, while the sum is 25.

The square root of 485701 is about 696.9225208013. The cubic root of 485701 is about 78.6061150273.

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