Search a number
-
+
857100641 is a prime number
BaseRepresentation
bin110011000101100…
…101000101100001
32012201210020001012
4303011211011201
53223404210031
6221014350305
730145143455
oct6305450541
92181706035
10857100641
113aa8a1441
121bb05b395
13108756257
1481b90665
15503a5b2b
hex33165161

857100641 has 2 divisors, whose sum is σ = 857100642. Its totient is φ = 857100640.

The previous prime is 857100571. The next prime is 857100667. The reversal of 857100641 is 146001758.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 708358225 + 148742416 = 26615^2 + 12196^2 .

It is a cyclic number.

It is not a de Polignac number, because 857100641 - 226 = 789991777 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 857100598 and 857100607.

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

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

Almost surely, 2857100641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6720, while the sum is 32.

The square root of 857100641 is about 29276.2812016827. The cubic root of 857100641 is about 949.8986562253.

The spelling of 857100641 in words is "eight hundred fifty-seven million, one hundred thousand, six hundred forty-one".