Search a number
-
+
10325857 is a prime number
BaseRepresentation
bin100111011000…
…111101100001
3201102121102011
4213120331201
510120411412
61005152521
7153524353
oct47307541
921377364
1010325857
115912a73
12355b741
1321a6c99
14152b0d3
15d8e7a7
hex9d8f61

10325857 has 2 divisors, whose sum is σ = 10325858. Its totient is φ = 10325856.

The previous prime is 10325801. The next prime is 10325879. The reversal of 10325857 is 75852301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7623121 + 2702736 = 2761^2 + 1644^2 .

It is a cyclic number.

It is not a de Polignac number, because 10325857 - 211 = 10323809 is a prime.

It is a Chen prime.

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

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

Almost surely, 210325857 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8400, while the sum is 31.

The square root of 10325857 is about 3213.3871537678. The cubic root of 10325857 is about 217.7586265977.

It can be divided in two parts, 1032 and 5857, that added together give a square (6889 = 832).

The spelling of 10325857 in words is "ten million, three hundred twenty-five thousand, eight hundred fifty-seven".